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 24, 2026 20:02Maya RebholzMaya RebholzScore: 7,488Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 20:037,20572,392,02854,186,0005,623,0002,117,632
2May 24, 2026 20:037,21071,203,29154,252,0005,593,0002,117,632
3May 24, 2026 20:037,25272,266,50854,507,0005,687,0002,113,536
4May 24, 2026 20:037,27670,297,55254,705,0005,686,0002,113,536
5May 24, 2026 20:037,48872,014,76656,489,0005,663,0002,113,536
6May 24, 2026 20:037,50471,841,60456,672,0005,616,0002,113,536
7May 24, 2026 20:037,51872,416,93756,696,0005,711,0002,117,632
8May 24, 2026 20:037,53473,957,27357,037,0005,502,0002,113,536
9May 24, 2026 20:037,57172,900,67957,134,0005,708,0002,117,632