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 14:58Joad NacerJoad NacerScore: 21,325Success
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 14:5818,591207,826,825154,306,85202,281,472
2Apr 27, 2024 14:5818,592215,572,491154,313,11202,273,280
3Apr 27, 2024 14:5818,592208,257,476154,312,16302,277,376
4Apr 27, 2024 14:5821,252204,037,020175,390,0001,002,0002,285,568
5Apr 27, 2024 14:5821,313203,645,311174,903,0001,998,0002,285,568
6Apr 27, 2024 14:5821,316204,392,112174,927,0001,999,0002,285,568
7Apr 27, 2024 14:5821,325201,120,240176,001,0001,000,0002,277,376
8Apr 27, 2024 14:5821,355204,504,814175,241,0002,002,0002,285,568
9Apr 27, 2024 14:5821,399207,793,561176,608,0001,003,0002,260,992
10Apr 27, 2024 14:5821,404207,633,439176,651,0001,003,0002,285,568
11Apr 27, 2024 14:5821,543205,188,665176,810,0001,997,0002,285,568
12Apr 27, 2024 14:5821,806202,779,138178,989,0001,999,0002,277,376