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 listMar 15, 2026 12:16eldon-chungeldon-chungScore: 56,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 12:1655,328485,224,319458,223,0001,000,0002,260,992
2Mar 15, 2026 12:1655,380484,482,250459,655,00002,273,280
3Mar 15, 2026 12:1655,388484,119,828454,725,0004,996,0002,273,280
4Mar 15, 2026 12:1655,396484,005,607457,788,0001,999,0002,273,280
5Mar 15, 2026 12:1655,415483,021,898458,943,000999,0002,273,280
6Mar 15, 2026 12:1656,216493,403,489464,596,0001,998,0002,273,280
7Mar 15, 2026 12:1656,869500,880,537469,012,0003,000,0002,273,280
8Mar 15, 2026 12:1656,875494,859,289472,061,00002,273,280
9Mar 15, 2026 12:1656,876504,774,015470,067,0002,000,0002,269,184
10Mar 15, 2026 12:1656,885500,671,073470,142,0002,000,0002,273,280
11Mar 15, 2026 12:1656,909499,277,248470,345,0002,001,0002,269,184
12Mar 15, 2026 12:1656,951497,271,136469,693,0002,998,0002,273,280