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 listSep 19, 2025 13:04EvgeniiBalabanovEvgeniiBalabanovScore: 2,067,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2025 13:042,064,72217,167,587,77917,076,221,00060,972,0002,277,376
2Sep 19, 2025 13:042,065,76717,178,630,11617,077,899,00067,967,0002,277,376
3Sep 19, 2025 13:042,065,97017,177,333,79817,075,583,00071,964,0002,277,376
4Sep 19, 2025 13:042,066,98217,190,686,66417,096,980,00058,972,0002,277,376
5Sep 19, 2025 13:042,067,37417,189,128,91617,102,233,00056,974,0002,277,376
6Sep 19, 2025 13:042,067,70617,193,351,55817,085,002,00076,959,0002,260,992
7Sep 19, 2025 13:042,068,76117,203,091,48617,108,754,00061,966,0002,277,376
8Sep 19, 2025 13:042,069,44417,212,642,03617,114,422,00061,965,0002,281,472
9Sep 19, 2025 13:042,070,07817,215,808,67917,108,684,00072,960,0002,289,664