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 listJun 10, 2026 15:52Victor MerckléVictor MerckléScore: 6,161Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 15:526,13058,436,67449,864,0001,020,0002,113,536
2Jun 10, 2026 15:526,14458,578,12149,979,0001,019,0002,113,536
3Jun 10, 2026 15:526,14458,534,54849,981,0001,022,0002,113,536
4Jun 10, 2026 15:526,15558,675,10050,070,0001,019,0002,113,536
5Jun 10, 2026 15:526,16158,716,97449,099,0002,041,0002,113,536
6Jun 10, 2026 15:526,17458,804,91350,215,0001,032,0002,113,536
7Jun 10, 2026 15:526,20559,066,81650,483,0001,019,0002,113,536
8Jun 10, 2026 15:526,23359,278,65349,680,0002,054,0002,113,536
9Jun 10, 2026 15:526,32760,140,03550,454,0002,067,0002,113,536