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 13, 2025 13:24Paweł KruszecPaweł KruszecScore: 532,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2025 13:24530,0394,429,958,8964,329,365,00069,957,0002,273,280
2Jun 13, 2025 13:24532,2654,447,183,2174,347,832,00069,965,0002,273,280
3Jun 13, 2025 13:24533,4674,456,683,3754,346,818,00080,959,0002,273,280