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 1, 2026 19:07Victor MerckléVictor MerckléScore: 4,163Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 19:084,13342,365,26033,289,0001,016,0002,117,632stderr
2Jul 1, 2026 19:084,14142,233,45533,253,0001,118,0002,117,632stderr
3Jul 1, 2026 19:084,15642,264,63833,389,0001,108,0002,117,632stderr
4Jul 1, 2026 19:084,15742,211,69733,471,0001,036,0002,117,632stderr
5Jul 1, 2026 19:084,16342,260,60133,538,0001,021,0002,117,632stderr
6Jul 1, 2026 19:084,16742,296,94933,425,0001,163,0002,117,632stderr
7Jul 1, 2026 19:084,17142,454,77633,502,0001,120,0002,117,632stderr
8Jul 1, 2026 19:084,17242,349,69133,579,0001,056,0002,117,632stderr
9Jul 1, 2026 19:084,18542,452,87233,618,0001,122,0002,117,632stderr