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 11, 2026 16:10Pavel SkripkinPavel SkripkinScore: 34,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 16:1034,426313,378,159284,734,000999,0002,277,376
2Jan 11, 2026 16:1034,431306,616,088283,782,0001,998,0002,277,376
3Jan 11, 2026 16:1034,447311,275,135283,915,0001,999,0002,482,176
4Jan 11, 2026 16:1034,479312,179,450285,177,0001,000,0002,490,368
5Jan 11, 2026 16:1034,493314,479,976285,291,0001,001,0002,486,272
6Jan 11, 2026 16:1034,510304,853,159285,428,0001,001,0002,490,368
7Jan 11, 2026 16:1034,521310,601,491285,524,0001,001,0002,486,272
8Jan 11, 2026 16:1034,541311,759,717284,690,0001,997,0002,277,376
9Jan 11, 2026 16:1034,546311,383,533284,734,0001,998,0002,277,376