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 listMay 25, 2026 20:02Maya RebholzMaya RebholzScore: 6,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 20:026,19860,813,89946,274,0005,174,0002,113,536
2May 25, 2026 20:026,20365,046,13146,283,0005,209,0002,117,632
3May 25, 2026 20:026,20663,034,79346,373,0005,140,0002,113,536
4May 25, 2026 20:026,25670,885,35746,587,0005,344,0002,113,536
5May 25, 2026 20:026,29162,056,34146,704,0005,518,0002,117,632
6May 25, 2026 20:026,38965,029,63047,613,0005,417,0002,113,536
7May 25, 2026 20:026,39364,523,50447,182,0005,883,0002,113,536
8May 25, 2026 20:026,45963,282,45548,275,0005,342,0002,113,536
9May 25, 2026 20:026,48664,259,96748,258,0005,582,0002,117,632