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 listSep 27, 2025 07:39sheryllynn24sheryllynn24Score: 6,371Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 07:396,27079,063,17950,037,0002,001,0002,289,664
2Sep 27, 2025 07:396,28275,322,14350,133,0002,005,0002,371,584
3Sep 27, 2025 07:396,29972,281,81650,269,0002,010,0002,289,664
4Sep 27, 2025 07:396,37180,622,06750,885,0001,995,0002,289,664
5Sep 27, 2025 07:396,40377,441,28451,136,0002,005,0002,363,392
6Sep 27, 2025 07:396,49884,310,95151,933,0001,997,0002,289,664