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 06:32M-RochatM-RochatScore: 14,780Success
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 06:3514,711131,490,563119,901,0002,202,0002,113,536
2May 20, 2026 06:3514,740133,261,095120,154,0002,194,0002,113,536
3May 20, 2026 06:3514,756132,346,334120,271,0002,210,0002,113,536
4May 20, 2026 06:3514,767132,879,401120,292,0002,275,0002,113,536
5May 20, 2026 06:3514,780133,762,814120,494,0002,180,0002,113,536
6May 20, 2026 06:3514,788133,702,117120,558,0002,186,0002,113,536
7May 20, 2026 06:3514,793133,919,470120,561,0002,224,0002,113,536
8May 20, 2026 06:3514,809132,934,336120,713,0002,206,0002,113,536
9May 20, 2026 06:3514,838134,584,919120,949,0002,212,0002,113,536