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 listNov 3, 2026 11:18Andrew EpsteinAndrew EpsteinScore: 16,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 11:1816,213143,904,809133,558,0001,018,0002,117,632stderr
2Nov 3, 2026 11:1816,269144,378,703134,018,0001,018,0002,117,632stderr
3Nov 3, 2026 11:1816,270144,840,263133,887,0001,154,0002,117,632stderr
4Nov 3, 2026 11:1816,279144,565,801133,938,0001,180,0002,117,632stderr
5Nov 3, 2026 11:1816,293144,556,795134,077,0001,157,0002,117,632stderr
6Nov 3, 2026 11:1816,302144,635,019134,298,0001,011,0002,117,632stderr
7Nov 3, 2026 11:1816,336145,346,533134,441,0001,149,0002,117,632stderr
8Nov 3, 2026 11:1816,374145,200,861134,895,0001,014,0002,117,632stderr
9Nov 3, 2026 11:1816,403145,514,495135,083,0001,070,0002,117,632stderr