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 13:16zielajzielajScore: 6,043Success
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 13:166,01477,772,11648,921,000998,0002,535,424
2Nov 11, 2024 13:166,03373,352,01249,076,0001,001,0002,273,280
3Nov 11, 2024 13:166,03771,927,25549,107,0001,002,0002,428,928
4Nov 11, 2024 13:166,03777,597,20649,106,0001,002,0002,273,280
5Nov 11, 2024 13:166,04074,500,12549,131,0001,002,0002,437,120
6Nov 11, 2024 13:166,04077,782,40249,128,0001,002,0002,514,944
7Nov 11, 2024 13:166,04374,125,89848,151,0002,006,0002,433,024
8Nov 11, 2024 13:166,08370,195,10049,479,0001,009,0002,273,280
9Nov 11, 2024 13:166,20377,285,52351,484,00002,535,424
10Nov 11, 2024 13:166,77874,200,92655,250,0001,004,0002,531,328
11Nov 11, 2024 13:166,80379,507,16856,464,00002,510,848
12Nov 11, 2024 13:166,85282,080,63355,878,000997,0002,433,024