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 9, 2026 06:03Victor MerckléVictor MerckléScore: 18,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 06:0416,775147,225,767138,134,0001,101,0002,117,632stderr
2Jul 9, 2026 06:0416,909148,217,749139,307,0001,040,0002,117,632stderr
3Jul 9, 2026 06:0418,228159,168,325150,244,0001,056,0002,117,632stderr
4Jul 9, 2026 06:0418,256159,716,315150,529,0001,001,0002,117,632stderr
5Jul 9, 2026 06:0418,276159,600,034150,649,0001,049,0002,117,632stderr
6Jul 9, 2026 06:0418,299159,823,489150,884,0001,005,0002,117,632stderr
7Jul 9, 2026 06:0418,340160,104,050151,184,0001,040,0002,117,632stderr
8Jul 9, 2026 06:0418,379160,442,432151,505,0001,044,0002,117,632stderr
9Jul 9, 2026 06:0418,463161,355,500152,193,0001,054,0002,117,632stderr