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 listAug 22, 2025 22:15Ashish AhujaAshish AhujaScore: 11,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 21:0611,088124,507,24474,027,00018,006,0002,449,408
2Aug 22, 2025 22:1511,170115,979,84474,770,00017,944,0002,510,848
3Aug 22, 2025 21:0611,178115,719,96076,817,00015,962,0002,498,560
4Aug 22, 2025 22:1511,233118,681,55172,407,00020,829,0002,433,024
5Aug 22, 2025 21:0611,263121,011,27671,603,00021,878,0002,260,992
6Aug 22, 2025 22:1511,281117,578,77775,705,00017,930,0002,461,696
7Aug 22, 2025 21:0611,287121,141,67274,750,00018,936,0002,392,064
8Aug 22, 2025 21:0611,316124,644,40272,937,00020,982,0002,396,160
9Aug 22, 2025 22:1511,329127,117,14976,024,00018,005,0002,371,584
10Aug 22, 2025 22:1511,477119,266,25374,421,00020,838,0002,506,752
11Aug 22, 2025 22:1511,583127,501,40576,317,00019,822,0002,502,656
12Aug 22, 2025 21:0611,659122,561,84476,820,00019,953,0002,506,752