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:51M-RochatM-RochatScore: 13,277Success
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:5213,194120,348,358107,348,0002,167,0002,113,536
2May 17, 2026 01:5213,200118,362,180107,354,0002,207,0002,113,536
3May 17, 2026 01:5213,227121,442,939107,567,0002,224,0002,113,536
4May 17, 2026 01:5213,257119,984,185107,828,0002,213,0002,113,536
5May 17, 2026 01:5213,277121,359,884107,011,0003,196,0002,113,536
6May 17, 2026 01:5213,281118,900,301106,987,0003,253,0002,113,536
7May 17, 2026 01:5213,297120,834,852107,122,0003,247,0002,113,536
8May 17, 2026 01:5213,325122,180,855107,031,0003,567,0002,113,536
9May 17, 2026 01:5213,341121,267,898107,489,0003,249,0002,113,536