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 listApr 15, 2025 22:47ParamParamScore: 1,320,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2025 22:471,316,01710,954,001,75910,839,976,00082,961,0002,281,472
2Apr 15, 2025 22:471,318,22710,967,282,61610,860,317,00080,965,0002,277,376
3Apr 15, 2025 22:471,319,99510,990,610,31010,878,993,00076,964,0002,277,376
4Apr 15, 2025 22:471,320,60910,990,912,26910,900,086,00060,972,0002,277,376
5Apr 15, 2025 22:471,320,93110,992,078,01910,888,766,00074,963,0002,273,280
6Apr 15, 2025 22:471,322,18311,012,271,24110,902,153,00071,968,0002,289,664
7Apr 15, 2025 22:471,323,84011,024,166,15610,918,909,00068,967,0002,277,376
8Apr 15, 2025 22:471,323,87711,020,331,03510,915,213,00072,968,0002,277,376
9Apr 15, 2025 22:471,326,62611,046,190,29410,942,035,00068,962,0002,277,376