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:44M-RochatM-RochatScore: 12,609Success
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:4512,590116,098,406102,267,0002,231,0002,113,536
2May 20, 2026 05:4512,596116,724,935102,323,0002,230,0002,113,536
3May 20, 2026 05:4512,599115,745,297102,332,0002,244,0002,113,536
4May 20, 2026 05:4512,601115,346,234102,563,0002,032,0002,113,536
5May 20, 2026 05:4512,609114,918,319102,624,0002,033,0002,113,536
6May 20, 2026 05:4512,619115,052,449102,707,0002,032,0002,113,536
7May 20, 2026 05:4512,622115,148,969102,733,0002,033,0002,113,536
8May 20, 2026 05:4512,629117,135,810102,795,0002,031,0002,113,536
9May 20, 2026 05:4512,658116,327,688102,793,0002,271,0002,113,536