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 22, 2025 20:39Matthew DowneyMatthew DowneyScore: 121,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2025 20:39121,4911,034,291,3761,007,378,000999,0002,289,664
2Mar 22, 2025 20:39121,5731,039,231,7231,008,052,0001,000,0002,281,472
3Mar 22, 2025 20:39121,6501,038,600,9241,008,693,000999,0002,289,664