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 listApr 28, 2026 06:19Victor MerckléVictor MerckléScore: 12,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 06:2012,593123,624,252103,517,0001,005,0002,383,872
2Apr 28, 2026 06:2012,597123,712,385102,549,0002,010,0002,367,488
3Apr 28, 2026 06:2012,601120,583,768102,597,0001,992,0002,387,968
4Apr 28, 2026 06:2012,611124,814,297103,666,0001,006,0002,387,968
5Apr 28, 2026 06:2012,628121,553,489102,819,0001,996,0002,318,336
6Apr 28, 2026 06:2012,635122,083,456101,880,0002,996,0002,383,872
7Apr 28, 2026 06:2012,640125,497,387102,915,0001,998,0002,375,680
8Apr 28, 2026 06:2012,841121,125,844104,573,0002,011,0002,387,968
9Apr 28, 2026 06:2012,898123,306,775104,053,0003,001,0002,314,240