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 2, 2026 11:23Victor MerckléVictor MerckléScore: 4,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 11:244,27043,320,31934,316,0001,131,0002,117,632stderr
2Jul 2, 2026 11:244,28043,249,86734,434,0001,094,0002,117,632stderr
3Jul 2, 2026 11:244,28243,245,38034,449,0001,098,0002,117,632stderr
4Jul 2, 2026 11:244,29543,427,74534,546,0001,109,0002,117,632stderr
5Jul 2, 2026 11:244,29843,511,34934,579,0001,099,0002,117,632stderr
6Jul 2, 2026 11:244,30743,447,93934,748,0001,006,0002,117,632stderr
7Jul 2, 2026 11:244,31143,519,25834,707,0001,077,0002,117,632stderr
8Jul 2, 2026 11:244,34643,784,96635,058,0001,019,0002,117,632stderr
9Jul 2, 2026 11:244,37744,091,28535,232,0001,099,0002,117,632stderr