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 listMar 7, 2026 23:43Ilya AlimovIlya AlimovScore: 2,079,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2026 23:432,068,76117,202,209,20817,094,751,00075,967,0002,277,376
2Mar 7, 2026 23:432,068,82217,207,109,03917,107,252,00063,974,0002,289,664
3Mar 7, 2026 23:432,069,58117,212,953,31417,100,557,00076,962,0002,277,376
4Mar 7, 2026 23:432,071,03717,224,674,98317,113,638,00075,967,0002,277,376
5Mar 7, 2026 23:432,079,60717,293,518,67917,184,771,00075,968,0002,277,376
6Mar 7, 2026 23:432,081,88917,308,308,97717,212,711,00066,967,0002,277,376
7Mar 7, 2026 23:432,115,89217,597,498,35817,483,936,00077,964,0002,277,376
8Mar 7, 2026 23:432,117,58817,614,656,41517,512,005,00063,974,0002,277,376
9Mar 7, 2026 23:432,125,01117,673,473,09717,571,623,00065,968,0002,277,376