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 6, 2025 15:02Rajarshi BasuRajarshi BasuScore: 7,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 15:026,96684,194,08455,787,0002,028,0002,289,664
2Dec 6, 2025 15:026,97686,606,49955,906,0001,996,0002,277,376
3Dec 6, 2025 15:026,98084,418,93955,941,0001,997,0002,265,088
4Dec 6, 2025 15:027,13286,811,38057,190,0002,006,0002,289,664
5Dec 6, 2025 15:027,13488,139,63558,210,0001,003,0002,289,664
6Dec 6, 2025 15:027,13888,195,08957,237,0002,008,0002,265,088