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 6, 2026 20:15flavio87flavio87Score: 16,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 20:1515,927150,992,744130,018,0002,181,0002,416,640
2May 6, 2026 20:1515,960149,268,370130,458,0002,014,0002,437,120
3May 6, 2026 20:1515,973150,996,476130,379,0002,198,0002,412,544
4May 6, 2026 20:1516,020149,850,508130,920,0002,052,0002,416,640
5May 6, 2026 20:1516,047150,520,633131,122,0002,071,0002,392,064
6May 6, 2026 20:1516,055152,056,276131,172,0002,090,0002,400,256
7May 6, 2026 20:1516,066150,388,665131,293,0002,063,0002,428,928
8May 6, 2026 20:1516,116150,879,820131,658,0002,110,0002,379,776
9May 6, 2026 20:1516,140154,963,974131,950,0002,014,0002,387,968