Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJun 6, 2026 19:04merripiummerripiumScore: 80,283Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 19:0480,161674,478,368609,815,00055,525,0002,113,536
2Jun 6, 2026 19:0480,171674,496,059609,866,00055,556,0002,113,536
3Jun 6, 2026 19:0480,204674,917,404610,255,00055,443,0002,113,536
4Jun 6, 2026 19:0480,253675,318,815610,649,00055,455,0002,113,536
5Jun 6, 2026 19:0480,283675,454,816609,860,00056,495,0002,113,536
6Jun 6, 2026 19:0480,368676,141,874610,573,00056,484,0002,113,536
7Jun 6, 2026 19:0480,396676,364,472609,836,00057,459,0002,113,536
8Jun 6, 2026 19:0480,467676,986,799610,423,00057,456,0002,113,536
9Jun 6, 2026 19:0480,476677,182,333610,459,00057,496,0002,113,536