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 4, 2026 23:47CCScore: 89,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:4789,040756,363,877680,392,00058,644,0002,355,200
2May 4, 2026 23:4789,058757,357,671680,625,00058,563,0002,367,488
3May 4, 2026 23:4789,074753,277,865680,438,00058,881,0002,363,392
4May 4, 2026 23:4789,095756,181,525680,742,00058,753,0002,359,296
5May 4, 2026 23:4789,173755,824,105680,260,00059,883,0002,355,200
6May 4, 2026 23:4789,188757,404,182680,575,00059,690,0002,359,296
7May 4, 2026 23:4789,211759,523,069680,317,00060,140,0002,363,392
8May 4, 2026 23:4789,239756,507,379680,475,00060,213,0002,363,392
9May 4, 2026 23:4789,397758,958,291680,127,00061,875,0002,347,008