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 listSep 12, 2026 15:04Kevin HeaveyKevin HeaveyScore: 56,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 15:0555,989474,983,223463,564,0001,145,0002,117,632
2Sep 12, 2026 15:0556,056475,417,896464,020,0001,252,0002,117,632
3Sep 12, 2026 15:0556,080475,735,475464,334,0001,136,0002,117,632
4Sep 12, 2026 15:0556,106475,934,187464,671,0001,009,0002,117,632
5Sep 12, 2026 15:0556,119476,081,798464,573,0001,219,0002,117,632
6Sep 12, 2026 15:0556,153476,318,087464,874,0001,200,0002,117,632
7Sep 12, 2026 15:0556,190476,660,999465,243,0001,141,0002,117,632
8Sep 12, 2026 15:0556,220476,931,594465,474,0001,157,0002,117,632
9Sep 12, 2026 15:0556,318477,804,270465,423,0002,021,0002,117,632