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 29, 2025 00:31Josu San MartinJosu San MartinScore: 41,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 00:3241,406368,913,022342,674,000999,0002,273,280
2Dec 29, 2025 00:3241,406368,043,384341,672,0001,998,0002,400,256
3Dec 29, 2025 00:3141,428370,728,213341,852,0001,999,0002,273,280
4Dec 29, 2025 00:3241,431365,554,583341,881,0001,999,0002,273,280
5Dec 29, 2025 00:3141,453365,573,894343,063,0001,000,0002,273,280
6Dec 29, 2025 00:3141,560370,114,400342,946,0001,999,0002,273,280