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 listJan 13, 2025 05:07Ian MckibbenIan MckibbenScore: 59,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 05:0759,514517,902,753491,971,0001,999,0002,289,664
2Jan 13, 2025 05:0759,531516,356,418492,106,0002,000,0002,281,472
3Jan 13, 2025 05:0759,744522,520,436493,874,0001,999,0002,289,664