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 14, 2026 07:31Victor 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 14, 2026 07:316,95965,269,58656,757,0001,006,0002,113,536
2May 14, 2026 07:316,96465,043,31356,775,0001,034,0002,113,536
3May 14, 2026 07:316,96466,591,01056,757,0001,047,0002,113,536
4May 14, 2026 07:316,96465,688,21657,807,00002,113,536
5May 14, 2026 07:316,96667,206,25656,784,0001,034,0002,113,536
6May 14, 2026 07:316,96866,068,56157,840,00002,113,536
7May 14, 2026 07:317,01565,661,60757,214,0001,016,0002,113,536
8May 14, 2026 07:317,02065,524,89458,272,00002,113,536
9May 14, 2026 07:317,16869,709,95658,464,0001,032,0002,113,536