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 15, 2026 19:08Daniel MastalerzDaniel MastalerzScore: 7,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 19:087,41986,080,94459,559,0002,018,0002,297,856
2Feb 15, 2026 19:087,42788,264,61659,627,0002,021,0002,494,464
3Feb 15, 2026 19:087,43090,529,45261,669,00002,297,856
4Feb 15, 2026 19:087,44491,667,88860,793,000996,0002,297,856
5Feb 15, 2026 19:087,44488,769,76158,796,0002,989,0002,297,856
6Feb 15, 2026 19:087,56792,238,02559,817,0002,990,0002,494,464
7Feb 15, 2026 19:087,58185,471,15659,923,0002,996,0002,498,560
8Feb 15, 2026 19:087,59190,438,10160,005,0003,000,0002,297,856
9Feb 15, 2026 19:087,62884,763,25460,298,0003,014,0002,498,560