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 14, 2026 02:02Victor MerckléVictor MerckléScore: 7,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 02:027,31969,960,39160,751,00002,113,536
2May 14, 2026 02:027,32369,727,99359,742,0001,046,0002,113,536
3May 14, 2026 02:027,32468,729,19259,794,0001,003,0002,113,536
4May 14, 2026 02:027,32670,825,49559,779,0001,034,0002,113,536
5May 14, 2026 02:027,32970,006,54759,796,0001,041,0002,113,536
6May 14, 2026 02:027,37970,913,59361,248,00002,113,536
7May 14, 2026 02:027,38671,035,75260,299,0001,007,0002,113,536
8May 14, 2026 02:027,45171,277,67160,804,0001,046,0002,113,536
9May 14, 2026 02:027,48971,348,78561,144,0001,015,0002,113,536