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 listAug 12, 2026 14:03Victor MerckléVictor MerckléScore: 3,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 14:043,76739,664,58130,186,0001,088,0002,117,632stderr
2Aug 12, 2026 14:043,76839,700,36930,123,0001,154,0002,117,632stderr
3Aug 12, 2026 14:043,77139,712,47030,167,0001,133,0002,117,632stderr
4Aug 12, 2026 14:043,77739,789,76630,249,0001,102,0002,117,632stderr
5Aug 12, 2026 14:043,77739,714,62430,257,0001,099,0002,117,632stderr
6Aug 12, 2026 14:043,78539,805,21930,283,0001,134,0002,117,632stderr
7Aug 12, 2026 14:043,79039,860,91530,399,0001,066,0002,117,632stderr
8Aug 12, 2026 14:043,79839,930,60530,449,0001,082,0002,117,632stderr
9Aug 12, 2026 14:043,85240,330,30930,951,0001,022,0002,117,632stderr