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 listFeb 19, 2026 01:21Josu San MartinJosu San MartinScore: 6,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 01:215,95371,383,71448,403,0001,008,0002,273,280
2Feb 19, 2026 01:216,00281,650,38647,827,0001,992,0002,277,376
3Feb 19, 2026 01:216,22379,271,49150,643,0001,012,0002,273,280
4Feb 19, 2026 01:216,28472,510,11250,155,0002,006,0002,392,064
5Feb 19, 2026 01:216,29276,835,71852,221,00002,281,472
6Feb 19, 2026 01:216,31477,138,81550,430,0001,977,0002,404,352