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 20:16Victor MerckléVictor MerckléScore: 34,239Success
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 20:1734,160291,472,106282,528,0001,008,0002,117,632stderr
2Jul 9, 2026 20:1734,169291,776,355282,596,0001,008,0002,117,632stderr
3Jul 9, 2026 20:1734,183291,775,054282,719,0001,001,0002,117,632stderr
4Jul 9, 2026 20:1734,230292,151,434283,095,0001,015,0002,117,632stderr
5Jul 9, 2026 20:1734,239292,299,813282,993,0001,194,0002,117,632stderr
6Jul 9, 2026 20:1734,282292,689,629283,522,0001,019,0002,117,632stderr
7Jul 9, 2026 20:1734,290292,774,663283,539,0001,076,0002,117,632stderr
8Jul 9, 2026 20:1734,389294,903,988284,421,0001,008,0002,117,632stderr
9Jul 9, 2026 20:1735,214300,457,181291,165,0001,116,0002,117,632stderr