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 30, 2024 02:39Steve HanSteve HanScore: 16,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2024 02:4016,062194,747,884133,315,21602,273,280
2Apr 30, 2024 02:3916,104190,569,220133,660,15402,277,376
3Apr 30, 2024 02:3916,125195,843,263133,837,08402,269,184
4Apr 30, 2024 02:4016,136197,432,231133,930,54802,269,184
5Apr 30, 2024 02:4016,158201,968,321134,114,98902,269,184
6Apr 30, 2024 02:3916,194209,649,537134,407,66702,281,472
7Apr 30, 2024 02:4016,895198,713,522140,232,11702,273,280
8Apr 30, 2024 02:4016,910201,839,504140,354,36002,277,376
9Apr 30, 2024 02:4016,929197,426,026140,513,96902,277,376