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 12, 2026 15:31Kevin HeaveyKevin HeaveyScore: 3,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 15:363,89441,935,45131,050,0001,274,0002,117,632
2Jul 12, 2026 15:363,90141,935,90931,080,0001,299,0002,117,632
3Jul 12, 2026 15:363,90542,039,55031,389,0001,023,0002,117,632
4Jul 12, 2026 15:363,90742,015,92731,408,0001,022,0002,117,632
5Jul 12, 2026 15:363,91342,222,94031,460,0001,019,0002,117,632
6Jul 12, 2026 15:363,91842,112,81831,502,0001,024,0002,117,632
7Jul 12, 2026 15:364,00742,896,28732,239,0001,021,0002,117,632
8Jul 12, 2026 15:364,01442,955,31132,103,0001,218,0002,117,632
9Jul 12, 2026 15:364,03943,211,72132,453,0001,073,0002,117,632