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 20, 2026 05:04M-RochatM-RochatScore: 68,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:0668,170575,719,838507,797,00058,019,0002,113,536
2May 20, 2026 05:0668,213574,661,828508,279,00057,892,0002,113,536
3May 20, 2026 05:0668,217575,785,650507,819,00058,384,0002,113,536
4May 20, 2026 05:0668,219575,688,960508,011,00058,213,0002,113,536
5May 20, 2026 05:0668,287576,236,607508,594,00058,196,0002,113,536
6May 20, 2026 05:0668,310576,385,834508,597,00058,377,0002,113,536
7May 20, 2026 05:0668,312576,616,246508,820,00058,172,0002,113,536
8May 20, 2026 05:0668,315574,642,365508,330,00058,690,0002,113,536
9May 20, 2026 05:0668,340574,875,023508,831,00058,392,0002,113,536