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 31, 2025 21:13Adam FolwarcznyAdam FolwarcznyScore: 8,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2025 21:137,98092,519,01748,173,00018,065,0002,265,088
2Aug 31, 2025 21:137,98087,605,94147,166,00019,067,0002,277,376
3Aug 31, 2025 21:138,00996,176,53949,353,00017,122,0002,400,256
4Aug 31, 2025 21:138,12996,097,28852,367,00015,105,0002,506,752
5Aug 31, 2025 21:138,15493,197,39854,742,00012,939,0002,535,424
6Aug 31, 2025 21:138,15794,538,86547,791,00019,913,0002,277,376
7Aug 31, 2025 21:138,18894,745,28551,971,00015,991,0002,371,584
8Aug 31, 2025 21:138,20292,150,89552,056,00016,017,0002,502,656
9Aug 31, 2025 21:138,20696,264,49951,084,00017,028,0002,523,136
10Aug 31, 2025 21:138,22394,723,96350,186,00018,066,0002,531,328
11Aug 31, 2025 21:138,22694,766,98050,201,00018,072,0002,478,080
12Aug 31, 2025 21:138,23488,502,63851,255,00017,085,0002,277,376