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:20Victor MerckléVictor MerckléScore: 10,488Success
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:2110,43794,412,08585,582,0001,050,0002,117,632stderr
2Jul 1, 2026 19:2110,45694,945,41185,651,0001,141,0002,117,632stderr
3Jul 1, 2026 19:2110,47394,691,05685,798,0001,132,0002,117,632stderr
4Jul 1, 2026 19:2110,48694,835,11285,988,0001,050,0002,117,632stderr
5Jul 1, 2026 19:2110,48894,907,84485,905,0001,146,0002,117,632stderr
6Jul 1, 2026 19:2110,52395,160,64586,205,0001,141,0002,117,632stderr
7Jul 1, 2026 19:2110,52495,092,28486,296,0001,061,0002,117,632stderr
8Jul 1, 2026 19:2110,52595,258,88586,292,0001,067,0002,117,632stderr
9Jul 1, 2026 19:2110,53495,214,46386,307,0001,130,0002,117,632stderr