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 listJan 3, 2026 04:48Josu San MartinJosu San MartinScore: 8,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 04:488,74898,827,37371,599,0001,008,0002,514,944
2Jan 4, 2026 03:538,75498,847,78171,646,0001,009,0002,469,888
3Jan 4, 2026 03:538,77097,817,10470,795,0001,994,0002,510,848
4Jan 3, 2026 04:488,78491,958,66769,908,0002,996,0002,281,472
5Jan 3, 2026 04:488,78795,736,79670,938,0001,998,0002,527,232
6Jan 4, 2026 03:538,80495,136,57371,073,0002,002,0002,383,872
7Jan 4, 2026 03:538,93997,095,11672,191,0002,005,0002,387,968
8Jan 4, 2026 03:538,94196,097,15373,209,0001,002,0002,379,776
9Jan 3, 2026 04:488,95596,803,35173,321,0001,004,0002,260,992
10Jan 3, 2026 04:488,97094,788,34273,441,0001,006,0002,523,136
11Jan 4, 2026 03:538,97396,812,30473,466,0001,006,0002,260,992
12Jan 3, 2026 04:489,06792,861,30774,249,0001,003,0002,387,968