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 4, 2025 05:17Lickety SplitLickety SplitScore: 104,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 4, 2025 05:17104,806898,495,420868,891,000999,0002,478,080
2Feb 4, 2025 05:17104,881898,484,905868,514,0001,998,0002,318,336
3Feb 4, 2025 05:17104,927896,840,339867,896,0002,999,0002,318,336