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 3, 2026 01:19CheckHarryCheckHarryScore: 6,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 01:206,20761,516,71850,469,0001,050,0002,113,536
2Sep 3, 2026 01:206,20861,402,30650,485,0001,043,0002,113,536
3Sep 3, 2026 01:206,20961,358,75050,494,0001,046,0002,113,536
4Sep 3, 2026 01:206,20962,171,25150,482,0001,055,0002,113,536
5Sep 3, 2026 01:206,21161,501,18950,499,0001,060,0002,113,536
6Sep 3, 2026 01:206,21761,535,74650,556,0001,053,0002,113,536
7Sep 3, 2026 01:206,22172,316,74850,553,0001,082,0002,113,536
8Sep 3, 2026 01:206,28261,970,81050,977,0001,166,0002,113,536
9Sep 3, 2026 01:206,37462,718,54051,736,0001,169,0002,113,536