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 22, 2026 05:46wnwnScore: 3,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 05:463,45546,830,67426,705,0001,978,0002,490,368
2Apr 22, 2026 05:463,46749,324,76326,796,0001,984,0002,478,080
3Apr 22, 2026 05:463,48442,750,25026,930,0001,994,0002,490,368
4Apr 22, 2026 05:463,52448,940,99728,246,0001,008,0002,478,080
5Apr 22, 2026 05:463,54149,076,79828,385,0001,013,0002,486,272
6Apr 22, 2026 05:463,55348,487,82828,480,0001,017,0002,482,176
7Apr 22, 2026 05:463,56848,384,82428,601,0001,021,0002,490,368
8Apr 22, 2026 05:463,57247,348,77528,628,0001,022,0002,498,560
9Apr 22, 2026 05:463,57347,253,87928,642,0001,022,0002,486,272