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 9, 2026 14:36wnwnScore: 3,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 14:373,38440,552,42527,065,0001,025,0002,486,272
2May 9, 2026 14:373,38945,250,12327,061,0001,068,0002,486,272
3May 9, 2026 14:373,39442,436,66727,100,0001,077,0002,482,176
4May 9, 2026 14:373,39943,235,66927,148,0001,069,0002,482,176
5May 9, 2026 14:373,41843,443,14827,308,0001,064,0002,482,176
6May 9, 2026 14:373,44942,870,13427,569,0001,063,0002,494,464
7May 9, 2026 14:373,53545,424,08928,272,0001,074,0002,490,368
8May 9, 2026 14:373,58342,623,83428,681,0001,058,0002,482,176
9May 9, 2026 14:373,58845,878,88528,710,0001,077,0002,478,080