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 listSep 6, 2025 20:36Adam FolwarcznyAdam FolwarcznyScore: 7,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2025 20:107,34383,896,65646,958,00013,987,0002,449,408
2Sep 6, 2025 20:367,35587,678,67544,035,00017,013,0002,301,952
3Sep 8, 2025 20:107,38980,684,20245,243,00016,086,0002,371,584
4Sep 8, 2025 20:107,40782,737,23545,351,00016,124,0002,277,376
5Sep 6, 2025 20:367,42086,722,12344,424,00017,164,0002,289,664
6Sep 6, 2025 20:367,42386,934,79348,480,00013,130,0002,269,184
7Sep 6, 2025 20:367,42385,814,24144,442,00017,170,0002,473,984
8Sep 6, 2025 20:367,42487,633,89342,429,00019,194,0002,277,376
9Sep 6, 2025 20:367,44586,620,84347,841,00013,953,0002,281,472
10Sep 8, 2025 20:107,44886,555,25447,860,00013,959,0002,531,328
11Sep 8, 2025 20:107,45883,066,20941,934,00019,968,0002,277,376
12Sep 8, 2025 20:107,51187,101,37044,244,00018,100,0002,342,912