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 listNov 14, 2024 02:56zielajzielajScore: 4,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2024 02:564,64965,574,07738,585,00002,527,232
2Nov 14, 2024 02:564,65262,709,96437,594,0001,016,0002,527,232
3Nov 14, 2024 02:564,65967,070,54637,655,0001,017,0002,379,776
4Nov 14, 2024 02:564,68067,281,12137,845,000995,0002,523,136
5Nov 14, 2024 02:564,68164,562,33837,854,000996,0002,363,392
6Nov 14, 2024 02:564,68168,384,32537,855,000996,0002,514,944
7Nov 14, 2024 02:564,68460,326,08437,879,000996,0002,514,944
8Nov 14, 2024 02:564,68665,093,39536,899,0001,994,0002,375,680
9Nov 14, 2024 02:564,69262,476,14337,942,000998,0002,523,136
10Nov 14, 2024 02:564,70560,234,06738,047,0001,001,0002,367,488
11Nov 14, 2024 02:564,73376,318,22938,280,0001,007,0002,367,488
12Nov 14, 2024 02:564,86064,180,88839,329,0001,008,0002,371,584