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 8, 2026 12:09chereshnya123chereshnya123Score: 57,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 12:1057,846489,199,221422,394,00057,733,0002,113,536
2Jun 8, 2026 12:1057,924489,936,601422,396,00058,375,0002,113,536
3Jun 8, 2026 12:1057,930489,937,981422,591,00058,232,0002,113,536
4Jun 8, 2026 12:1057,934489,901,178422,333,00058,523,0002,113,536
5Jun 8, 2026 12:1057,950490,069,321422,458,00058,530,0002,113,536
6Jun 8, 2026 12:1058,012490,570,060422,261,00059,239,0002,113,536
7Jun 8, 2026 12:1058,014490,615,603422,610,00058,909,0002,113,536
8Jun 8, 2026 12:1058,077491,197,686422,344,00059,702,0002,113,536
9Jun 8, 2026 12:1058,104491,328,386422,032,00060,238,0002,113,536