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 7, 2026 10:10wnwnScore: 3,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:103,38946,309,94427,049,0001,082,0002,490,368
2May 7, 2026 10:103,39043,905,24827,070,0001,067,0002,482,176
3May 7, 2026 10:103,39343,342,42627,104,0001,064,0002,490,368
4May 7, 2026 10:103,39743,504,15627,137,0001,064,0002,494,464
5May 7, 2026 10:103,40744,511,29627,215,0001,068,0002,478,080
6May 7, 2026 10:103,41142,289,64527,237,0001,078,0002,490,368
7May 7, 2026 10:103,41943,661,40027,264,0001,116,0002,478,080
8May 7, 2026 10:103,59646,102,55228,707,0001,140,0002,494,464
9May 7, 2026 10:103,84251,867,06630,816,0001,079,0002,478,080