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 17, 2026 14:31Victor MerckléVictor MerckléScore: 7,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 14:327,47671,808,95461,009,0001,044,0002,113,536
2May 17, 2026 14:327,47871,250,10961,036,0001,039,0002,113,536
3May 17, 2026 14:327,48072,075,62161,048,0001,040,0002,113,536
4May 17, 2026 14:327,48071,291,18661,061,0001,023,0002,113,536
5May 17, 2026 14:327,48269,518,77461,096,0001,011,0002,113,536
6May 17, 2026 14:327,48369,475,16961,104,0001,009,0002,113,536
7May 17, 2026 14:327,48669,509,60161,090,0001,045,0002,113,536
8May 17, 2026 14:327,49170,172,05261,161,0001,022,0002,113,536
9May 17, 2026 14:327,53569,883,60561,523,0001,020,0002,113,536