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 11, 2024 01:39Joad NacerJoad NacerScore: 4,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 01:394,48563,390,40135,213,0002,012,0002,334,720
2Oct 11, 2024 01:394,49559,508,55634,282,0003,024,0002,334,720
3Oct 11, 2024 01:394,49863,365,76434,309,0003,027,0002,334,720
4Oct 11, 2024 01:394,56261,636,44834,879,0002,989,0002,330,624
5Oct 11, 2024 01:394,56960,877,44635,930,0001,996,0002,330,624
6Oct 11, 2024 01:394,58359,288,81235,038,0003,003,0002,506,752