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 17, 2026 06:37olliecrowolliecrowScore: 6,148Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:376,06759,473,89148,182,0002,182,0002,117,632
2May 17, 2026 06:376,08860,623,00748,315,0002,219,0002,117,632
3May 17, 2026 06:376,08961,413,07848,293,0002,252,0002,117,632
4May 17, 2026 06:376,12660,902,28848,701,0002,145,0002,117,632
5May 17, 2026 06:376,14860,306,33148,854,0002,182,0002,117,632
6May 17, 2026 06:376,14959,877,28748,960,0002,077,0002,117,632
7May 17, 2026 06:376,16960,044,15448,982,0002,221,0002,117,632
8May 17, 2026 06:376,17160,703,42748,939,0002,286,0002,117,632
9May 17, 2026 06:376,20160,842,42649,435,0002,036,0002,117,632