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 26, 2024 00:56haiwwkeshaiwwkesScore: 62,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 26, 2024 00:5662,328538,199,876458,286,00059,036,0002,453,504
2Oct 26, 2024 00:5662,363544,086,882467,650,00049,962,0002,285,568
3Oct 26, 2024 00:5662,398542,401,557454,916,00062,988,0002,293,760
4Oct 26, 2024 00:5662,404546,113,804465,959,00051,995,0002,293,760
5Oct 26, 2024 00:5662,407545,474,694463,977,00053,997,0002,293,760
6Oct 26, 2024 00:5662,471545,985,561455,570,00062,940,0002,289,664
7Oct 26, 2024 00:5662,497538,496,904479,749,00038,979,0002,293,760
8Oct 26, 2024 00:5662,504543,865,106468,804,00049,979,0002,293,760
9Oct 26, 2024 00:5662,508546,662,492474,835,00043,984,0002,293,760