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 7, 2026 10:39wnwnScore: 3,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:403,45545,770,05327,617,0001,064,0002,478,080
2May 7, 2026 10:403,45641,791,30727,656,0001,037,0002,486,272
3May 7, 2026 10:403,46543,140,70627,719,0001,042,0002,486,272
4May 7, 2026 10:403,46844,680,61827,715,0001,076,0002,486,272
5May 7, 2026 10:403,47442,775,62227,737,0001,102,0002,494,464
6May 7, 2026 10:403,53547,566,35428,247,0001,098,0002,478,080
7May 7, 2026 10:403,55844,208,69928,445,0001,087,0002,490,368
8May 7, 2026 10:403,65547,545,21329,257,0001,081,0002,498,560
9May 7, 2026 10:403,71146,997,82829,706,0001,101,0002,486,272