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 19, 2025 08:57Parinay ChauhanParinay ChauhanScore: 2,069,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2025 08:572,065,62217,175,687,71117,075,699,00068,966,0002,277,376
2May 19, 2025 08:572,065,82017,178,778,67417,088,330,00057,973,0002,281,472
3May 19, 2025 08:572,067,10617,190,029,81017,086,007,00070,970,0002,289,664
4May 19, 2025 08:572,067,35017,192,593,94417,098,029,00060,975,0002,277,376
5May 19, 2025 08:572,069,05917,204,145,42717,114,213,00058,976,0002,277,376
6May 19, 2025 08:572,070,33817,213,683,94517,107,843,00075,963,0002,277,376
7May 19, 2025 08:572,071,16317,228,338,10317,115,684,00074,967,0002,277,376
8May 19, 2025 08:572,072,15317,231,943,72317,131,901,00066,968,0002,277,376
9May 19, 2025 08:572,087,17117,354,453,21617,247,550,00075,967,0002,277,376