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:39Andrew EpsteinAndrew EpsteinScore: 4,346Success
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,24544,939,59132,928,0002,312,0002,113,536
2Aug 21, 2026 01:394,28345,338,40533,252,0002,302,0002,113,536
3Aug 21, 2026 01:394,29745,417,70333,363,0002,303,0002,113,536
4Aug 21, 2026 01:394,33345,731,38133,667,0002,301,0002,113,536
5Aug 21, 2026 01:394,34645,769,84533,742,0002,331,0002,113,536
6Aug 21, 2026 01:394,37846,104,66034,043,0002,302,0002,113,536
7Aug 21, 2026 01:394,39146,274,01034,144,0002,309,0002,113,536
8Aug 21, 2026 01:394,39346,280,98934,145,0002,317,0002,113,536
9Aug 21, 2026 01:394,40446,246,94734,519,0002,038,0002,113,536