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:58M-RochatM-RochatScore: 12,734Success
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:5912,613113,484,043102,533,0002,163,0002,113,536
2May 17, 2026 01:5912,642116,521,737102,783,0002,151,0002,113,536
3May 17, 2026 01:5912,697117,121,319103,215,0002,172,0002,113,536
4May 17, 2026 01:5912,717122,518,133102,263,0003,294,0002,113,536
5May 17, 2026 01:5912,734116,307,960102,506,0003,190,0002,113,536
6May 17, 2026 01:5912,758116,088,254102,734,0003,160,0002,113,536
7May 17, 2026 01:5912,765116,421,763103,745,0002,212,0002,113,536
8May 17, 2026 01:5912,915142,889,170103,872,0003,327,0002,113,536
9May 17, 2026 01:5913,001124,460,261103,498,0004,412,0002,113,536