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: 16,811Success
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:5116,726147,600,722133,607,0005,219,0002,113,536
2May 17, 2026 01:5116,761149,268,046134,171,0004,952,0002,113,536
3May 17, 2026 01:5116,774148,512,176135,151,0004,080,0002,113,536
4May 17, 2026 01:5116,789150,217,454134,334,0005,021,0002,113,536
5May 17, 2026 01:5116,811149,315,474134,380,0005,154,0002,113,536
6May 17, 2026 01:5116,823151,295,227134,561,0005,075,0002,113,536
7May 17, 2026 01:5116,850150,983,890135,765,0004,095,0002,113,536
8May 17, 2026 01:5116,857148,653,217134,794,0005,124,0002,113,536
9May 17, 2026 01:5116,870150,857,073134,921,0005,100,0002,113,536