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 listApr 27, 2024 18:57Joad NacerJoad NacerScore: 13,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 18:5712,948170,010,053107,470,98202,281,472
2Apr 27, 2024 18:5712,953165,590,834107,510,84802,265,088
3Apr 27, 2024 18:5713,267168,556,055110,114,96702,269,184
4Apr 27, 2024 18:5713,484132,527,056109,918,0001,998,0002,285,568
5Apr 27, 2024 18:5713,489135,153,714109,960,0001,999,0002,519,040
6Apr 27, 2024 18:5713,492143,600,565109,981,0001,999,0002,285,568
7Apr 27, 2024 18:5713,494133,672,434109,999,0001,999,0002,260,992
8Apr 27, 2024 18:5713,499136,150,920110,039,0002,000,0002,285,568
9Apr 27, 2024 18:5713,513139,033,171110,153,0002,002,0002,285,568
10Apr 27, 2024 18:5713,556133,904,306111,514,0001,004,0002,510,848
11Apr 27, 2024 18:5713,636143,413,016111,175,0002,003,0002,285,568
12Apr 27, 2024 18:5713,857139,992,474114,017,0001,000,0002,285,568