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 16:58Victor MerckléVictor MerckléScore: 45,131Success
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 17:0043,584369,803,741360,625,0001,123,0002,117,632stderr
2Jul 9, 2026 17:0044,446377,146,848367,881,0001,024,0002,117,632stderr
3Jul 9, 2026 17:0045,118382,575,762373,359,0001,122,0002,117,632stderr
4Jul 9, 2026 17:0045,126382,615,993373,423,0001,127,0002,117,632stderr
5Jul 9, 2026 17:0045,131382,468,439373,461,0001,130,0002,117,632stderr
6Jul 9, 2026 17:0045,340384,447,732375,300,0001,025,0002,117,632stderr
7Jul 9, 2026 17:0045,344384,511,958375,332,0001,027,0002,117,632stderr
8Jul 9, 2026 17:0045,372384,592,857375,539,0001,051,0002,117,632stderr
9Jul 9, 2026 17:0045,373385,268,257375,581,0001,016,0002,117,632stderr