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 listMar 18, 2026 00:19Elijah KinElijah KinScore: 65,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 00:1965,739570,726,956495,669,00049,966,0002,486,272
2Mar 18, 2026 00:1965,763568,398,687487,855,00057,982,0002,277,376
3Mar 18, 2026 00:1965,953576,025,243491,368,00056,042,0002,310,144