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 23:42Victor MerckléVictor MerckléScore: 6,968Success
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 23:426,96166,870,57157,778,00002,113,536
2May 15, 2026 23:426,96665,569,62656,820,0001,002,0002,113,536
3May 15, 2026 23:426,96667,065,61557,819,00002,113,536
4May 15, 2026 23:426,96766,619,13057,831,00002,113,536
5May 15, 2026 23:426,96867,367,66856,802,0001,039,0002,113,536
6May 15, 2026 23:426,97066,929,39456,830,0001,021,0002,113,536
7May 15, 2026 23:426,98767,256,84456,984,0001,014,0002,113,536
8May 15, 2026 23:427,03466,617,08557,341,0001,045,0002,113,536
9May 15, 2026 23:427,11567,333,88959,056,00002,113,536