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 listDec 4, 2025 13:31Rajarshi BasuRajarshi BasuScore: 8,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 13:318,670104,329,49469,965,0001,999,0002,490,368
2Dec 4, 2025 13:318,67697,534,31270,010,0002,000,0002,281,472
3Dec 4, 2025 13:318,82296,095,34072,223,0001,003,0002,498,560
4Dec 4, 2025 13:318,861100,112,36772,536,0001,007,0002,494,464
5Dec 4, 2025 13:318,914100,052,75571,989,0001,999,0002,281,472
6Dec 4, 2025 13:319,014101,728,58072,820,0001,995,0002,502,656