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 17:17Victor MerckléVictor MerckléScore: 4,503Success
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:184,45844,846,50035,901,0001,107,0002,117,632stderr
2Jul 9, 2026 17:184,46744,945,63535,941,0001,137,0002,117,632stderr
3Jul 9, 2026 17:184,49145,170,99936,243,0001,035,0002,117,632stderr
4Jul 9, 2026 17:184,49645,204,13136,257,0001,067,0002,117,632stderr
5Jul 9, 2026 17:184,50345,194,65036,330,0001,048,0002,117,632stderr
6Jul 9, 2026 17:184,54345,556,14736,599,0001,109,0002,117,632stderr
7Jul 9, 2026 17:184,57945,838,67136,885,0001,128,0002,117,632stderr
8Jul 9, 2026 17:184,61946,286,41337,275,0001,070,0002,117,632stderr
9Jul 9, 2026 17:184,63346,373,41037,433,0001,025,0002,117,632stderr