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 listSep 22, 2026 18:22stdkFeanorstdkFeanorScore: 68,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2026 18:2368,402578,894,813566,731,0001,007,0002,113,536
2Sep 22, 2026 18:2368,437578,611,631566,952,0001,080,0002,113,536
3Sep 22, 2026 18:2368,440579,171,024567,011,0001,048,0002,113,536
4Sep 22, 2026 18:2368,543580,132,391567,840,0001,067,0002,113,536
5Sep 22, 2026 18:2368,690581,374,378569,027,0001,105,0002,113,536
6Sep 22, 2026 18:2368,703581,434,220569,237,0001,003,0002,113,536
7Sep 22, 2026 18:2368,709581,590,830569,189,0001,103,0002,113,536
8Sep 22, 2026 18:2368,715581,593,391569,332,0001,003,0002,113,536
9Sep 22, 2026 18:2368,724581,912,891569,305,0001,110,0002,113,536