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 12:35wnwnScore: 3,563Success
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 12:353,41242,370,55027,284,0001,040,0002,486,272
2May 9, 2026 12:353,42140,761,27627,340,0001,060,0002,482,176
3May 9, 2026 12:353,55642,961,64928,477,0001,045,0002,490,368
4May 9, 2026 12:353,55744,557,60628,472,0001,053,0002,486,272
5May 9, 2026 12:353,56345,716,24128,485,0001,092,0002,482,176
6May 9, 2026 12:353,56347,970,67428,496,0001,077,0002,490,368
7May 9, 2026 12:353,57545,313,90928,612,0001,063,0002,478,080
8May 9, 2026 12:353,58145,827,78328,650,0001,080,0002,486,272
9May 9, 2026 12:353,58346,086,48728,638,0001,103,0002,486,272