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 13, 2026 17:47M-RochatM-RochatScore: 24,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:4824,619215,212,744203,298,0001,046,0002,113,536
2May 13, 2026 17:4824,622212,965,431203,327,0001,043,0002,113,536
3May 13, 2026 17:4824,635214,978,162203,458,0001,013,0002,113,536
4May 13, 2026 17:4824,663215,452,078203,684,0001,025,0002,113,536
5May 13, 2026 17:4824,668214,031,962203,713,0001,035,0002,113,536
6May 13, 2026 17:4824,685215,454,082203,855,0001,031,0002,113,536
7May 13, 2026 17:4824,749215,319,602204,403,0001,018,0002,113,536
8May 13, 2026 17:4824,784216,450,330204,706,0001,004,0002,113,536
9May 13, 2026 17:4824,858218,049,889205,208,0001,116,0002,113,536