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 listJun 25, 2025 10:28Valentin KofmanValentin KofmanScore: 7,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2025 10:286,61481,825,36052,900,0001,996,0002,289,664
2Jun 25, 2025 10:286,65877,346,49953,255,0002,009,0002,289,664
3Jun 25, 2025 10:286,66480,132,25553,298,0002,011,0002,265,088
4Jun 25, 2025 10:287,86988,914,42663,300,0002,009,0002,289,664
5Jun 25, 2025 10:288,20490,669,16567,095,0001,001,0002,273,280
6Jun 25, 2025 10:288,34390,308,30368,242,0001,003,0002,277,376