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 30, 2026 23:32Josu San MartinJosu San MartinScore: 5,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 23:395,40553,894,52943,764,0001,104,0002,113,536
2Aug 30, 2026 23:395,40653,319,21843,772,0001,103,0002,113,536
3Aug 30, 2026 23:395,43653,623,61744,000,0001,119,0002,113,536
4Aug 30, 2026 23:395,45561,536,92044,222,0001,055,0002,113,536
5Aug 30, 2026 23:395,45659,069,46944,262,0001,025,0002,113,536
6Aug 30, 2026 23:395,45758,460,71544,224,0001,072,0002,113,536
7Aug 30, 2026 23:395,45864,483,15644,144,0001,160,0002,113,536
8Aug 30, 2026 23:395,46258,606,75044,324,0001,018,0002,113,536
9Aug 30, 2026 23:395,47961,403,45444,431,0001,050,0002,113,536