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 03:33M-RochatM-RochatScore: 12,748Success
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 03:3312,646115,464,686102,785,0002,184,0002,113,536
2May 17, 2026 03:3312,672114,760,808102,995,0002,186,0002,113,536
3May 17, 2026 03:3312,724116,324,882102,400,0003,215,0002,113,536
4May 17, 2026 03:3312,731114,815,635103,491,0002,177,0002,113,536
5May 17, 2026 03:3312,748115,043,187102,651,0003,164,0002,113,536
6May 17, 2026 03:3312,758117,041,288102,744,0003,155,0002,113,536
7May 17, 2026 03:3312,758114,734,995102,680,0003,215,0002,113,536
8May 17, 2026 03:3312,761114,722,363102,721,0003,199,0002,113,536
9May 17, 2026 03:3312,775119,313,647102,796,0003,239,0002,113,536