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 05:31Andrew EpsteinAndrew EpsteinScore: 3,506Success
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 05:413,46237,961,13828,739,000020,480
2Nov 3, 2026 05:413,49938,334,10529,042,000020,480
3Nov 3, 2026 05:413,50338,384,90029,077,000020,480
4Nov 3, 2026 05:413,50538,292,64029,093,000020,480
5Nov 3, 2026 05:413,50638,444,91429,106,000020,480
6Nov 3, 2026 05:413,50938,913,66129,125,000020,480
7Nov 3, 2026 05:413,51138,851,42729,144,000020,480
8Nov 3, 2026 05:413,52638,538,85529,269,000020,480
9Nov 3, 2026 05:413,54738,626,23229,447,000020,480