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 listAug 21, 2026 01:38Andrew EpsteinAndrew EpsteinScore: 4,380Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 01:394,25645,093,00233,034,0002,298,0002,113,536
2Aug 21, 2026 01:394,33145,635,48233,614,0002,335,0002,113,536
3Aug 21, 2026 01:394,33245,804,87633,610,0002,346,0002,113,536
4Aug 21, 2026 01:394,38046,226,40534,036,0002,324,0002,113,536
5Aug 21, 2026 01:394,38046,196,56734,058,0002,299,0002,113,536
6Aug 21, 2026 01:394,38346,142,26434,046,0002,335,0002,113,536
7Aug 21, 2026 01:394,40746,415,68634,274,0002,310,0002,113,536
8Aug 21, 2026 01:394,41546,447,38534,343,0002,304,0002,113,536
9Aug 21, 2026 01:394,41646,372,98234,256,0002,400,0002,113,536