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 19, 2026 03:55wnwnScore: 4,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 03:564,09362,761,30631,975,0001,998,0002,490,368
2Apr 19, 2026 03:564,10652,873,14632,074,0002,004,0002,531,328
3Apr 19, 2026 03:554,12253,193,66732,202,0002,012,0002,490,368
4Apr 19, 2026 03:554,12854,579,45833,258,0001,007,0002,498,560
5Apr 19, 2026 03:554,17858,356,45433,655,0001,019,0002,523,136
6Apr 19, 2026 03:564,26357,539,80734,371,0001,010,0002,269,184