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 listFeb 15, 2026 23:17wnwnScore: 8,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:177,20687,932,18452,830,0006,977,0002,277,376
2Feb 15, 2026 23:177,20981,406,19152,852,0006,980,0002,437,120
3Feb 15, 2026 23:177,32790,470,56255,828,0004,984,0002,297,856
4Feb 15, 2026 23:178,45694,945,39462,167,0008,021,0002,400,256
5Feb 15, 2026 23:178,603102,839,97363,359,0008,045,0002,465,792
6Feb 15, 2026 23:178,60798,888,35362,379,0009,055,0002,293,760