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 listFeb 5, 2026 04:06Josu San MartinJosu San MartinScore: 5,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 04:065,73271,449,43346,560,0001,012,0002,531,328
2Feb 5, 2026 04:065,76568,281,90345,855,0001,993,0002,437,120
3Feb 5, 2026 04:065,91170,090,99847,059,0002,002,0002,285,568
4Feb 5, 2026 04:065,96573,741,47247,488,0002,020,0002,449,408
5Feb 5, 2026 04:065,96776,755,75048,515,0001,010,0002,273,280
6Feb 5, 2026 04:066,04374,623,53448,153,0002,006,0002,285,568