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 listJan 4, 2026 06:18Josu San MartinJosu San MartinScore: 10,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 06:1810,043110,870,85082,350,0001,004,0002,277,376
2Jan 4, 2026 06:1810,081107,705,21181,678,0001,992,0002,412,544
3Jan 4, 2026 06:1810,290107,983,11884,405,0001,004,0002,273,280
4Jan 4, 2026 06:1810,296110,143,69784,453,0001,005,0002,428,928
5Jan 4, 2026 06:1810,300110,729,48784,481,0001,005,0002,416,640
6Jan 4, 2026 06:1810,790114,729,59288,550,0001,006,0002,420,736