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 listOct 10, 2024 20:07Joad NacerJoad NacerScore: 9,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 20:079,662101,024,84177,186,0003,007,0002,502,656
2Oct 10, 2024 20:079,688101,843,10078,402,0002,010,0002,314,240
3Oct 10, 2024 20:079,716116,881,24077,620,0003,024,0002,510,848
4Oct 10, 2024 20:079,884105,747,74879,040,0003,001,0002,310,144
5Oct 10, 2024 20:079,927101,687,93680,383,0002,009,0002,310,144
6Oct 10, 2024 20:079,956108,766,96580,623,0002,015,0002,277,376