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 22:44Victor MerckléVictor MerckléScore: 4,502Success
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 22:454,47944,907,81236,085,0001,092,0002,113,536
2Jun 24, 2026 22:454,48744,791,50736,132,0001,113,0002,113,536
3Jun 24, 2026 22:454,49245,249,46136,183,0001,108,0002,113,536
4Jun 24, 2026 22:454,49644,924,97836,238,0001,082,0002,113,536
5Jun 24, 2026 22:454,50245,016,66936,227,0001,140,0002,113,536
6Jun 24, 2026 22:454,50844,989,62136,327,0001,094,0002,113,536
7Jun 24, 2026 22:454,52145,132,68236,433,0001,092,0002,113,536
8Jun 24, 2026 22:454,70947,983,83837,967,0001,122,0002,113,536
9Jun 24, 2026 22:454,71047,027,69138,061,0001,035,0002,113,536