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 listMay 7, 2025 18:11rogue *rogue *Score: 58,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2025 18:1158,731513,672,098431,414,00056,053,0002,400,256
2May 7, 2025 18:1158,745511,974,978427,635,00059,948,0002,265,088
3May 7, 2025 18:1158,749512,184,374427,667,00059,953,0002,260,992
4May 7, 2025 18:1158,804510,956,732432,063,00056,008,0002,510,848
5May 7, 2025 18:1158,812512,134,392432,127,00056,016,0002,404,352
6May 7, 2025 18:1158,825513,794,781431,216,00057,028,0002,265,088
7May 7, 2025 18:1158,854513,998,138430,429,00058,057,0002,387,968
8May 7, 2025 18:1158,908511,453,671433,943,00054,992,0002,387,968
9May 7, 2025 18:1158,929512,835,743428,098,00061,014,0002,260,992