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 3, 2025 21:54Adam FolwarcznyAdam FolwarcznyScore: 7,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2025 21:547,02184,243,29040,189,00018,085,0002,486,272
2Sep 3, 2025 21:547,04181,878,11044,335,00014,106,0002,273,280
3Sep 3, 2025 21:547,05886,453,68040,402,00018,181,0002,482,176
4Sep 3, 2025 21:547,10380,162,32542,969,00015,988,0002,273,280
5Sep 3, 2025 21:547,11180,729,01443,014,00016,005,0002,281,472
6Sep 3, 2025 21:547,12677,596,43042,105,00017,042,0002,449,408
7Sep 3, 2025 21:547,13983,908,50142,181,00017,073,0002,330,624
8Sep 3, 2025 21:547,14382,927,84841,201,00018,088,0002,281,472
9Sep 3, 2025 21:547,18886,295,16641,462,00018,202,0002,273,280
10Sep 3, 2025 21:547,18983,980,37942,478,00017,193,0002,506,752
11Sep 3, 2025 21:547,24684,254,52247,111,00013,030,0002,539,520
12Sep 3, 2025 21:547,24784,214,40747,118,00013,032,0002,531,328