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 21, 2026 20:14BenBenScore: 20,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 20:1520,561187,149,505167,670,0002,994,0002,531,328
2Apr 21, 2026 20:1520,630190,540,323169,234,0002,002,0002,338,816
3Apr 21, 2026 20:1520,652189,188,084169,415,0002,004,0002,519,040
4Apr 21, 2026 20:1520,713189,366,052168,926,0002,998,0002,523,136
5Apr 21, 2026 20:1520,720188,030,398168,984,0002,999,0002,514,944
6Apr 21, 2026 20:1520,731191,704,117169,068,0003,001,0002,514,944
7Apr 21, 2026 20:1520,913193,374,912171,576,0002,006,0002,334,720
8Apr 21, 2026 20:1520,942192,923,890171,828,0001,998,0002,523,136
9Apr 21, 2026 20:1520,958192,552,236171,957,0001,999,0002,519,040