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 listApr 14, 2026 06:53wnwnScore: 4,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 06:534,01553,890,79032,319,0001,009,0002,277,376
2Apr 14, 2026 06:534,02857,716,47832,420,0001,013,0002,494,464
3Apr 14, 2026 06:534,04255,445,09832,534,0001,016,0002,277,376
4Apr 14, 2026 06:534,07761,612,58731,851,0001,990,0002,498,560
5Apr 14, 2026 06:534,17558,683,70333,633,0001,019,0002,486,272
6Apr 14, 2026 06:534,19661,398,31632,836,0001,990,0002,277,376
7Apr 14, 2026 06:534,21157,462,89032,953,0001,997,0002,498,560
8Apr 14, 2026 06:534,25756,429,90734,320,0001,009,0002,277,376
9Apr 14, 2026 06:534,27759,380,67734,487,0001,014,0002,277,376