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 8, 2026 20:55Victor MerckléVictor MerckléScore: 16,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 21:0316,559145,958,462136,286,0001,154,0002,117,632stderr
2Sep 8, 2026 21:0316,568146,646,094136,354,0001,167,0002,117,632stderr
3Sep 8, 2026 21:0316,582146,172,618136,623,0001,015,0002,117,632stderr
4Sep 8, 2026 21:0316,599146,878,980136,643,0001,134,0002,117,632stderr
5Sep 8, 2026 21:0316,611146,357,791136,857,0001,019,0002,117,632stderr
6Sep 8, 2026 21:0316,612146,526,633136,722,0001,163,0002,117,632stderr
7Sep 8, 2026 21:0316,627147,202,834136,868,0001,143,0002,117,632stderr
8Sep 8, 2026 21:0316,673147,618,660137,380,0001,014,0002,117,632stderr
9Sep 8, 2026 21:0316,695147,060,798137,563,0001,008,0002,117,632stderr