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 01:50M-RochatM-RochatScore: 13,846Success
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 01:5013,797123,120,533112,323,0002,197,0002,113,536
2May 17, 2026 01:5013,804123,928,268112,446,0002,133,0002,113,536
3May 17, 2026 01:5013,811124,230,658112,455,0002,181,0002,113,536
4May 17, 2026 01:5013,836125,661,117112,568,0002,273,0002,113,536
5May 17, 2026 01:5013,846124,785,137112,677,0002,248,0002,113,536
6May 17, 2026 01:5013,915125,125,291112,320,0003,181,0002,113,536
7May 17, 2026 01:5013,929124,241,108112,414,0003,204,0002,113,536
8May 17, 2026 01:5013,932124,401,400112,366,0003,270,0002,113,536
9May 17, 2026 01:5013,980124,921,639112,872,0003,166,0002,113,536