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 11, 2024 09:48ZOTTIGZOTTIGScore: 91,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 09:4890,600778,633,582676,979,00074,997,0002,535,424
2Nov 11, 2024 09:4890,684781,350,390679,711,00072,968,0002,543,616
3Nov 11, 2024 09:4891,222782,881,853683,132,00074,014,0002,396,160
4Nov 11, 2024 09:4891,259783,950,146685,503,00071,947,0002,367,488
5Nov 11, 2024 09:4891,355786,339,310681,225,00077,025,0002,330,624
6Nov 11, 2024 09:4891,362786,038,826682,277,00076,030,0002,506,752
7Nov 11, 2024 09:4891,623789,247,505683,524,00076,946,0002,543,616
8Nov 11, 2024 09:4892,244793,828,541692,665,00072,964,0002,535,424
9Nov 11, 2024 09:4892,321793,371,544693,333,00072,929,0002,301,952