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 21, 2026 14:35Victor MerckléVictor MerckléScore: 4,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 14:364,67746,705,66537,750,0001,074,0002,113,536
2May 21, 2026 14:364,67846,689,01537,782,0001,050,0002,113,536
3May 21, 2026 14:364,68847,267,01237,842,0001,076,0002,113,536
4May 21, 2026 14:364,69746,881,24737,984,0001,007,0002,113,536
5May 21, 2026 14:364,69848,240,25537,927,0001,069,0002,113,536
6May 21, 2026 14:364,70146,936,26237,988,0001,034,0002,113,536
7May 21, 2026 14:364,70846,914,23138,047,0001,036,0002,113,536
8May 21, 2026 14:364,72748,608,08038,185,0001,054,0002,113,536
9May 21, 2026 14:364,77647,539,58238,643,0001,005,0002,113,536