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 listOct 24, 2025 06:32Rashin SergeyRashin SergeyScore: 72,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2025 06:3272,198619,628,025548,222,00051,020,0002,289,664
2Oct 24, 2025 06:3272,216626,903,075539,354,00060,039,0002,461,696
3Oct 24, 2025 06:3272,256621,474,212540,752,00058,973,0002,289,664
4Oct 24, 2025 06:3272,509620,927,663557,840,00043,987,0002,453,504
5Oct 24, 2025 06:3272,623631,967,891533,798,00068,973,0002,281,472
6Oct 24, 2025 06:3272,694632,198,902549,415,00053,942,0002,289,664
7Oct 24, 2025 06:3273,168638,423,343544,371,00062,927,0002,289,664
8Oct 24, 2025 06:3273,506634,956,390550,087,00060,009,0002,289,664
9Oct 24, 2025 06:3274,183636,839,035542,750,00072,966,0002,453,504