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 listOct 11, 2025 23:40Marco BarboneMarco BarboneScore: 31,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 23:4031,533288,253,820259,726,0001,997,0002,424,832
2Oct 11, 2025 23:4031,721289,896,718263,284,00002,539,520
3Oct 11, 2025 23:4031,799289,458,781262,933,000999,0002,539,520