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 24, 2026 21:40Victor MerckléVictor MerckléScore: 4,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 21:424,49644,815,27036,172,0001,149,0002,117,632stderr
2Jun 24, 2026 21:424,50145,169,45236,227,0001,134,0002,117,632stderr
3Jun 24, 2026 21:424,50544,924,19336,270,0001,124,0002,117,632stderr
4Jun 24, 2026 21:424,50844,890,78136,270,0001,148,0002,117,632stderr
5Jun 24, 2026 21:424,52546,480,42836,424,0001,139,0002,117,632stderr
6Jun 24, 2026 21:424,70846,622,27237,939,0001,142,0002,117,632stderr
7Jun 24, 2026 21:424,71346,585,53337,980,0001,138,0002,117,632stderr
8Jun 24, 2026 21:424,73746,792,79238,269,0001,055,0002,117,632stderr
9Jun 24, 2026 21:424,92048,640,20339,794,0001,044,0002,117,632stderr