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 5, 2026 22:23TonyTonyScore: 8,823Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 22:238,78482,749,78370,363,0002,552,0002,113,536
2Aug 5, 2026 22:238,79782,879,23870,372,0002,649,0002,113,536
3Aug 5, 2026 22:238,80782,916,78770,408,0002,697,0002,113,536
4Aug 5, 2026 22:238,81482,953,58971,065,0002,094,0002,113,536
5Aug 5, 2026 22:238,82383,038,51470,550,0002,685,0002,113,536
6Aug 5, 2026 22:238,82983,094,96670,625,0002,660,0002,113,536
7Aug 5, 2026 22:238,86683,377,13570,909,0002,681,0002,113,536
8Aug 5, 2026 22:238,87783,564,80170,995,0002,690,0002,113,536
9Aug 5, 2026 22:238,92683,941,22971,467,0002,624,0002,113,536