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 listApr 27, 2026 10:18wnwnScore: 3,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:183,41143,927,74227,304,0001,011,0002,326,528
2Apr 27, 2026 10:183,41346,030,68528,333,00002,490,368
3Apr 27, 2026 10:183,43140,542,86327,462,0001,017,0002,482,176
4Apr 27, 2026 10:183,44446,864,36727,570,0001,021,0002,486,272
5Apr 27, 2026 10:183,44843,613,39227,597,0001,022,0002,469,888
6Apr 27, 2026 10:183,47142,216,96526,825,0001,987,0002,473,984
7Apr 27, 2026 10:183,49944,236,57827,044,0002,003,0002,486,272
8Apr 27, 2026 10:183,58846,622,52128,757,0001,027,0002,486,272
9Apr 27, 2026 10:183,64944,494,21829,279,0001,009,0002,490,368