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 3, 2025 14:54Rajarshi BasuRajarshi BasuScore: 12,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2025 14:5412,755134,695,511104,868,000998,0002,498,560
2Dec 3, 2025 14:5412,759131,629,398103,900,0001,998,0002,289,664
3Dec 3, 2025 14:5412,769132,708,653102,985,0002,999,0002,490,368