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 22, 2026 23:07wnwnScore: 4,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 23:104,52468,551,24036,534,0001,014,0002,535,424
2Feb 22, 2026 23:074,56162,336,95436,830,0001,023,0002,277,376
3Feb 22, 2026 23:074,60358,758,08536,195,0002,010,0002,490,368
4Feb 22, 2026 23:074,60859,704,79136,233,0002,012,0002,531,328
5Feb 22, 2026 23:104,60963,945,46736,240,0002,013,0002,498,560
6Feb 22, 2026 23:108,31790,974,44467,034,0002,001,0002,490,368