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 listSep 6, 2026 11:54CheckHarryCheckHarryScore: 6,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 11:556,44963,416,52552,512,0001,019,0002,113,536
2Sep 6, 2026 11:556,49071,365,97052,836,0001,039,0002,113,536
3Sep 6, 2026 11:556,50570,865,33152,939,0001,060,0002,113,536
4Sep 6, 2026 11:556,53964,216,91953,222,0001,058,0002,113,536
5Sep 6, 2026 11:556,55864,396,14853,410,0001,029,0002,113,536
6Sep 6, 2026 11:556,59874,148,37353,725,0001,044,0002,113,536
7Sep 6, 2026 11:556,61464,785,76953,885,0001,014,0002,113,536
8Sep 6, 2026 11:556,63564,922,64954,058,0001,017,0002,113,536
9Sep 6, 2026 11:556,73365,767,85454,883,0001,009,0002,113,536