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:52M-RochatM-RochatScore: 12,741Success
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:5212,716114,464,691103,304,0002,245,0002,113,536
2May 17, 2026 01:5212,722116,960,048102,416,0003,178,0002,113,536
3May 17, 2026 01:5212,724114,564,080103,395,0002,215,0002,113,536
4May 17, 2026 01:5212,735116,476,333103,493,0002,212,0002,113,536
5May 17, 2026 01:5212,741114,510,012103,487,0002,269,0002,113,536
6May 17, 2026 01:5212,749116,196,258103,610,0002,208,0002,113,536
7May 17, 2026 01:5212,766115,916,131103,704,0002,255,0002,113,536
8May 17, 2026 01:5212,766114,792,965103,770,0002,189,0002,113,536
9May 17, 2026 01:5212,826116,606,960103,316,0003,144,0002,113,536