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 listJul 9, 2026 02:51Victor MerckléVictor MerckléScore: 20,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 02:5319,978173,909,521164,648,0001,171,0002,117,632stderr
2Jul 9, 2026 02:5319,983173,920,790164,850,0001,011,0002,117,632stderr
3Jul 9, 2026 02:5319,996174,063,264164,821,0001,151,0002,117,632stderr
4Jul 9, 2026 02:5320,067174,611,712165,417,0001,143,0002,117,632stderr
5Jul 9, 2026 02:5320,159175,439,529166,311,0001,012,0002,117,632stderr
6Jul 9, 2026 02:5320,415177,559,992168,419,0001,030,0002,117,632stderr
7Jul 9, 2026 02:5320,415177,599,876168,411,0001,034,0002,117,632stderr
8Jul 9, 2026 02:5320,421178,762,034168,469,0001,032,0002,117,632stderr
9Jul 9, 2026 02:5320,473178,017,404168,778,0001,148,0002,117,632stderr