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 listJan 21, 2025 23:40Gerard SmitGerard SmitScore: 58,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 23:4058,366519,193,031483,437,0001,000,0002,383,872
2Jan 21, 2025 23:4058,384511,248,127481,590,0002,997,0002,293,760
3Jan 21, 2025 23:4058,388515,121,483482,625,0001,998,0002,371,584
4Jan 21, 2025 23:4058,393510,864,448481,666,0002,997,0002,293,760
5Jan 21, 2025 23:4058,401511,374,984482,731,0001,998,0002,387,968
6Jan 21, 2025 23:4058,407512,922,243482,779,0001,999,0002,297,856
7Jan 21, 2025 23:4058,409519,610,078483,794,000999,0002,310,144
8Jan 21, 2025 23:4058,419513,235,004481,881,0002,999,0002,310,144
9Jan 21, 2025 23:4058,449505,609,676482,124,0003,000,0002,293,760