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 15, 2026 14:06Victor MerckléVictor MerckléScore: 6,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 14:066,96167,185,23357,784,00002,113,536
2May 15, 2026 14:066,96166,350,07556,748,0001,032,0002,113,536
3May 15, 2026 14:066,96266,148,65256,788,0001,004,0002,113,536
4May 15, 2026 14:066,96567,259,42756,799,0001,014,0002,113,536
5May 15, 2026 14:066,96665,892,75756,816,0001,009,0002,113,536
6May 15, 2026 14:066,96865,126,38657,837,00002,113,536
7May 15, 2026 14:066,97466,827,82656,856,0001,029,0002,113,536
8May 15, 2026 14:067,02467,488,52058,302,00002,113,536
9May 15, 2026 14:067,02569,622,50157,288,0001,026,0002,113,536