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 18:20Josu San MartinJosu San MartinScore: 4,739Success
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 18:204,71647,560,62538,095,0001,048,0002,113,536
2Aug 30, 2026 18:204,71647,616,89938,092,0001,057,0002,113,536
3Aug 30, 2026 18:204,73247,725,37738,153,0001,130,0002,113,536
4Aug 30, 2026 18:204,73547,783,39538,168,0001,137,0002,113,536
5Aug 30, 2026 18:204,73947,785,25338,205,0001,129,0002,113,536
6Aug 30, 2026 18:204,74247,803,55238,246,0001,113,0002,113,536
7Aug 30, 2026 18:204,75447,904,76638,430,0001,036,0002,113,536
8Aug 30, 2026 18:204,77148,073,47438,470,0001,133,0002,113,536
9Aug 30, 2026 18:204,79448,206,67438,656,0001,136,0002,113,536