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 13:43Victor MerckléVictor MerckléScore: 6,967Success
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 13:436,96368,497,84256,792,0001,001,0002,113,536
2May 15, 2026 13:436,96465,078,56357,808,00002,113,536
3May 15, 2026 13:436,96465,821,94657,804,00002,113,536
4May 15, 2026 13:436,96565,743,39256,813,0001,004,0002,113,536
5May 15, 2026 13:436,96767,198,31756,820,0001,007,0002,113,536
6May 15, 2026 13:436,97067,350,49956,847,0001,006,0002,113,536
7May 15, 2026 13:437,01365,619,14758,216,00002,113,536
8May 15, 2026 13:437,01966,212,18658,263,00002,113,536
9May 15, 2026 13:437,02567,676,89157,296,0001,015,0002,113,536