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:08wnwnScore: 4,409Success
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:084,37759,323,67334,307,0002,018,0002,535,424
2Feb 22, 2026 23:094,39361,465,11135,454,0001,012,0002,502,656
3Feb 22, 2026 23:094,39856,216,07535,488,0001,013,0002,498,560
4Feb 22, 2026 23:094,40062,561,68735,502,0001,014,0002,535,424
5Feb 22, 2026 23:094,40961,752,27735,578,0001,016,0002,535,424
6Feb 22, 2026 23:094,41964,747,61435,662,0001,018,0002,490,368
7Feb 22, 2026 23:084,43963,005,00535,852,000995,0002,273,280
8Feb 22, 2026 23:084,46864,821,16535,081,0002,004,0002,273,280
9Feb 22, 2026 23:094,49159,170,40335,260,0002,014,0002,535,424