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:11Adam FolwarcznyAdam FolwarcznyScore: 8,236Success
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:117,79194,184,49248,751,00015,918,0002,273,280
2Aug 31, 2025 21:117,85593,990,66042,129,00023,070,0002,269,184
3Aug 31, 2025 21:118,07897,526,01351,038,00016,012,0002,539,520
4Aug 31, 2025 21:118,13592,799,75050,387,00017,131,0002,277,376
5Aug 31, 2025 21:118,20990,285,49455,112,00013,026,0002,510,848
6Aug 31, 2025 21:118,21897,595,77852,163,00016,050,0002,523,136
7Aug 31, 2025 21:118,23695,245,09952,273,00016,084,0002,531,328
8Aug 31, 2025 21:118,27397,178,75351,750,00016,918,0002,318,336
9Aug 31, 2025 21:118,29689,516,61151,893,00016,965,0002,523,136
10Aug 31, 2025 21:118,29993,412,04451,909,00016,970,0002,465,792
11Aug 31, 2025 21:118,39192,331,84957,706,00011,939,0002,322,432
12Aug 31, 2025 21:118,40896,713,24349,845,00019,938,0002,310,144