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 26, 2026 12:47Victor MerckléVictor MerckléScore: 4,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 12:484,15742,206,91533,496,0001,009,0002,113,536
2Jun 26, 2026 12:484,18842,420,01933,747,0001,019,0002,113,536
3Jun 26, 2026 12:484,23142,550,89734,112,0001,013,0002,113,536
4Jun 26, 2026 12:484,24442,700,02034,212,0001,019,0002,113,536
5Jun 26, 2026 12:484,24442,876,03734,225,0001,006,0002,113,536
6Jun 26, 2026 12:484,32843,592,39534,913,0001,017,0002,113,536
7Jun 26, 2026 12:484,35843,770,80935,089,0001,087,0002,113,536
8Jun 26, 2026 12:484,38845,395,12535,324,0001,102,0002,113,536
9Jun 26, 2026 12:484,50245,092,55036,264,0001,106,0002,113,536