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 listDec 27, 2024 08:29korsajankorsajanScore: 101,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2024 08:29101,510867,086,658785,566,00056,968,0002,334,720
2Dec 27, 2024 08:29101,634869,740,703779,593,00063,966,0002,334,720
3Dec 27, 2024 08:29101,647868,879,897790,688,00052,979,0002,334,720
4Dec 27, 2024 08:29101,711874,193,643788,189,00056,013,0002,527,232
5Dec 27, 2024 08:29101,784865,431,935795,761,00049,046,0002,334,720
6Dec 27, 2024 08:29101,829877,821,630787,165,00058,012,0002,334,720
7Dec 27, 2024 08:29101,893873,554,483795,673,00050,042,0002,334,720
8Dec 27, 2024 08:29102,009867,860,774799,695,00046,982,0002,334,720
9Dec 27, 2024 08:29103,681893,720,343785,502,00075,047,0002,334,720