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:14wnwnScore: 3,501Success
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:153,38843,513,34227,066,0001,055,0002,494,464
2May 7, 2026 10:153,38843,350,06027,055,0001,068,0002,478,080
3May 7, 2026 10:153,41042,610,85827,217,0001,088,0002,473,984
4May 7, 2026 10:153,50045,157,09327,932,0001,125,0002,490,368
5May 7, 2026 10:153,50147,954,17027,974,0001,085,0002,490,368
6May 7, 2026 10:153,54844,860,97528,392,0001,059,0002,486,272
7May 7, 2026 10:153,59045,781,42228,709,0001,091,0002,482,176
8May 7, 2026 10:153,59944,807,34728,797,0001,075,0002,469,888
9May 7, 2026 10:153,61544,349,79128,934,0001,078,0002,494,464