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 13, 2026 23:32boop34boop34Score: 56,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2026 23:3356,300477,215,263466,289,0001,005,0002,113,536
2Jul 13, 2026 23:3356,341477,988,986466,633,0001,004,0002,113,536
3Jul 13, 2026 23:3356,343479,387,043465,644,0002,008,0002,113,536
4Jul 13, 2026 23:3356,451478,796,026467,543,0001,004,0002,113,536
5Jul 13, 2026 23:3356,463478,337,184467,639,0001,004,0002,113,536
6Jul 13, 2026 23:3356,469478,474,705466,673,0002,022,0002,113,536
7Jul 13, 2026 23:3356,480478,640,763467,763,0001,022,0002,113,536
8Jul 13, 2026 23:3356,486478,585,351467,837,0001,005,0002,113,536
9Jul 13, 2026 23:3356,495479,228,167466,896,0002,013,0002,113,536