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 listDec 15, 2025 09:23Pavitra GolchhaPavitra GolchhaScore: 372,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 09:23366,9003,073,080,1072,989,300,00055,968,0002,281,472
2Dec 15, 2025 09:23368,5743,090,994,3712,996,199,00062,962,0002,281,472
3Dec 15, 2025 09:23371,7873,112,251,6373,026,851,00058,977,0002,363,392
4Dec 15, 2025 09:23372,1603,116,264,9993,022,951,00065,977,0002,355,200
5Dec 15, 2025 09:23372,3333,118,161,8753,003,409,00086,953,0002,281,472
6Dec 15, 2025 09:23373,0533,121,841,3693,023,380,00072,960,0002,355,200
7Dec 15, 2025 09:23373,0683,127,448,8433,027,501,00068,965,0002,281,472
8Dec 15, 2025 09:23377,7243,165,955,6693,082,127,00052,984,0002,355,200
9Dec 15, 2025 09:23379,1993,172,282,6313,075,412,00071,939,0002,281,472