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 14, 2026 12:40marko1597marko1597Score: 11,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 12:5011,879108,481,10597,555,0001,043,0002,113,536
2Aug 14, 2026 12:5011,881108,405,13697,577,0001,039,0002,113,536
3Aug 14, 2026 12:5011,891108,479,39497,648,0001,048,0002,113,536
4Aug 14, 2026 12:5011,902108,644,15197,730,0001,060,0002,113,536
5Aug 14, 2026 12:5011,910108,728,29597,804,0001,056,0002,113,536
6Aug 14, 2026 12:5011,917109,413,34097,873,0001,046,0002,113,536
7Aug 14, 2026 12:5011,927108,730,42597,959,0001,042,0002,113,536
8Aug 14, 2026 12:5011,938118,020,57997,967,0001,121,0002,113,536
9Aug 14, 2026 12:5011,972109,251,67298,285,0001,089,0002,113,536