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 16, 2026 23:53Andrew EpsteinAndrew EpsteinScore: 4,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 23:544,04143,864,27232,410,0001,133,0002,113,536
2Sep 16, 2026 23:544,05744,118,56932,530,0001,145,0002,113,536
3Sep 16, 2026 23:544,05944,015,03632,566,0001,130,0002,113,536
4Sep 16, 2026 23:544,10056,918,66632,826,0001,207,0002,113,536
5Sep 16, 2026 23:544,11156,598,81232,910,0001,213,0002,113,536
6Sep 16, 2026 23:544,17346,246,44333,520,0001,118,0002,113,536
7Sep 16, 2026 23:544,21855,608,24333,845,0001,168,0002,117,632
8Sep 16, 2026 23:544,23045,493,12133,980,0001,133,0002,113,536
9Sep 16, 2026 23:544,44058,284,08035,833,0001,027,0002,117,632