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 26, 2025 04:50Ashish AhujaAshish AhujaScore: 11,346Success
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 22:2111,119121,510,09771,451,00020,840,0002,437,120
2Aug 22, 2025 22:2111,248122,667,62272,501,00020,856,0002,445,312
3Aug 26, 2025 04:5011,260118,913,46077,548,00015,907,0002,523,136
4Aug 26, 2025 04:5011,266122,457,62876,600,00016,911,0002,506,752
5Aug 22, 2025 22:2111,295116,631,00174,798,00018,948,0002,445,312
6Aug 26, 2025 04:5011,321125,754,26473,970,00019,992,0002,461,696
7Aug 22, 2025 22:2111,346119,834,36776,332,00017,843,0002,506,752
8Aug 26, 2025 04:5011,365126,810,78575,463,00018,865,0002,383,872
9Aug 22, 2025 22:2111,376125,380,89077,522,00016,895,0002,441,216
10Aug 26, 2025 04:5011,462122,630,67276,309,00018,829,0002,306,048
11Aug 26, 2025 04:5011,564122,270,39676,983,00018,995,0002,498,560
12Aug 22, 2025 22:2111,675127,183,73877,925,00018,981,0002,502,656