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 listMay 21, 2026 11:56Victor MerckléVictor MerckléScore: 4,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 11:574,85650,368,48739,234,0001,074,0002,113,536
2May 21, 2026 11:574,86149,921,90439,294,0001,055,0002,113,536
3May 21, 2026 11:574,87648,329,65539,404,0001,074,0002,113,536
4May 21, 2026 11:574,87849,293,79039,427,0001,062,0002,113,536
5May 21, 2026 11:574,87950,108,14239,490,0001,010,0002,113,536
6May 21, 2026 11:574,88350,253,97639,495,0001,037,0002,113,536
7May 21, 2026 11:574,91348,632,69539,781,0001,001,0002,113,536
8May 21, 2026 11:575,02850,156,82640,703,0001,032,0002,113,536
9May 21, 2026 11:575,05849,859,95240,888,0001,094,0002,113,536