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 17, 2025 19:29sheryllynn24sheryllynn24Score: 20,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2025 19:2920,594196,769,027165,930,0004,997,0002,519,040
2Sep 17, 2025 19:2920,594195,170,325168,931,0001,999,0002,273,280
3Sep 17, 2025 19:2920,595196,430,810168,942,0001,999,0002,273,280
4Sep 17, 2025 19:2920,599197,152,487167,975,0002,999,0002,392,064
5Sep 17, 2025 19:2920,626200,232,586169,195,0002,002,0002,260,992
6Sep 17, 2025 19:2920,638199,438,960170,291,0001,001,0002,510,848
7Sep 17, 2025 19:2920,653190,424,800169,420,0002,004,0002,277,376
8Sep 17, 2025 19:2921,110205,092,066174,210,0001,001,0002,277,376
9Sep 17, 2025 19:2921,123205,337,726174,319,0001,001,0002,277,376