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 listAug 11, 2026 10:56RabenknechtRabenknechtError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 10:570138,724,695127,716,0001,011,00024,576No answer to stdout. Died or killed?stderr
2Aug 11, 2026 10:5767,717572,166,853561,055,0001,001,0002,113,536
3Aug 11, 2026 10:5767,725572,172,516561,105,0001,018,0002,113,536
4Aug 11, 2026 10:5767,734572,655,476561,151,0001,042,0002,113,536
5Aug 11, 2026 10:5767,752574,413,619561,240,0001,102,0002,113,536
6Aug 11, 2026 10:5767,758572,640,055561,390,0001,009,0002,113,536
7Aug 11, 2026 10:5767,796572,767,953561,618,0001,095,0002,113,536
8Aug 11, 2026 10:5767,808572,895,587561,723,0001,090,0002,113,536
9Aug 11, 2026 10:5767,815573,672,069561,807,0001,065,0002,113,536