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 16, 2026 11:25marko1597marko1597Score: 10,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 11:4510,49597,833,14177,106,00010,009,0002,113,536
2Aug 16, 2026 11:4510,51497,317,66577,261,00010,006,0002,113,536
3Aug 16, 2026 11:4510,60698,807,86277,115,00010,918,0002,113,536
4Aug 16, 2026 11:4510,63898,419,27177,972,00010,327,0002,113,536
5Aug 16, 2026 11:4510,72098,987,01678,573,00010,405,0002,113,536
6Aug 16, 2026 11:4510,77599,495,36178,503,00010,933,0002,113,536
7Aug 16, 2026 11:4510,843101,142,71479,743,00010,261,0002,113,536
8Aug 16, 2026 11:4510,911101,255,78979,631,00010,932,0002,113,536
9Aug 16, 2026 11:4510,974101,419,91480,167,00010,920,0002,113,536