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 listFeb 19, 2026 05:11Josu San MartinJosu San MartinScore: 6,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 05:115,77875,123,65846,959,000999,0002,281,472
2Feb 19, 2026 05:115,82077,557,60447,297,0001,006,0002,387,968
3Feb 19, 2026 05:116,12076,805,02248,807,0001,992,0002,494,464
4Feb 19, 2026 05:116,12177,121,11649,807,000996,0002,375,680
5Feb 19, 2026 05:116,12278,343,23950,810,00002,301,952
6Feb 19, 2026 05:116,14671,672,18249,009,0002,000,0002,301,952