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 listAug 27, 2026 09:22Victor MerckléVictor MerckléScore: 3,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 09:233,85240,374,44730,834,0001,145,0002,113,536
2Aug 27, 2026 09:233,85340,354,95130,790,0001,195,0002,113,536
3Aug 27, 2026 09:233,86040,374,01630,879,0001,164,0002,113,536
4Aug 27, 2026 09:233,86540,381,96230,943,0001,144,0002,113,536
5Aug 27, 2026 09:233,86940,447,20231,032,0001,086,0002,113,536
6Aug 27, 2026 09:233,87140,303,00931,079,0001,051,0002,113,536
7Aug 27, 2026 09:233,90740,730,78031,355,0001,079,0002,113,536
8Aug 27, 2026 09:233,92840,941,69531,511,0001,093,0002,113,536
9Aug 27, 2026 09:233,94641,116,28431,631,0001,129,0002,113,536