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 15, 2026 23:01Victor MerckléVictor MerckléScore: 6,956Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 23:016,94766,715,54756,656,0001,010,0002,113,536
2May 15, 2026 23:016,95066,221,93356,681,0001,010,0002,113,536
3May 15, 2026 23:016,95065,047,93656,689,0001,003,0002,113,536
4May 15, 2026 23:016,95266,886,40556,703,0001,002,0002,113,536
5May 15, 2026 23:016,95666,872,40056,689,0001,046,0002,113,536
6May 15, 2026 23:016,95766,098,36656,749,0001,002,0002,113,536
7May 15, 2026 23:016,95867,297,97256,738,0001,014,0002,113,536
8May 15, 2026 23:017,01066,309,49957,166,0001,025,0002,113,536
9May 15, 2026 23:017,07966,553,88657,753,0001,008,0002,113,536