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 listJun 27, 2026 02:16Code HintsCode HintsScore: 6,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 02:166,14758,535,93048,951,0002,070,0002,113,536
2Jun 27, 2026 02:166,19758,954,05148,398,0003,045,0002,113,536
3Jun 27, 2026 02:166,30159,800,08350,270,0002,035,0002,113,536
4Jun 27, 2026 02:166,35860,626,99350,725,0002,050,0002,113,536
5Jun 27, 2026 02:166,36860,537,98750,817,0002,041,0002,113,536
6Jun 27, 2026 02:166,43661,152,16950,358,0003,069,0002,113,536
7Jun 27, 2026 02:166,46361,181,16650,607,0003,037,0002,113,536
8Jun 27, 2026 02:166,47261,392,86551,679,0002,042,0002,113,536
9Jun 27, 2026 02:167,01265,735,04255,174,0003,028,0002,113,536