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 19, 2026 17:15Adam FolwarcznyAdam FolwarcznyScore: 18,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 17:1618,660164,734,863153,877,0001,005,0002,113,536
2Jul 19, 2026 17:1618,733165,256,605154,485,0001,006,0002,113,536
3Jul 19, 2026 17:1618,795166,383,459154,993,0001,006,0002,113,536
4Jul 19, 2026 17:1618,856166,945,781155,501,0001,005,0002,113,536
5Jul 19, 2026 17:1618,976168,551,078156,503,0001,005,0002,113,536
6Jul 19, 2026 17:1619,024168,310,745156,902,0001,004,0002,113,536
7Jul 19, 2026 17:1619,128169,166,263157,760,0001,005,0002,113,536
8Jul 19, 2026 17:1619,289170,551,262159,095,0001,005,0002,113,536
9Jul 19, 2026 17:1619,485172,182,435160,724,0001,004,0002,113,536