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 listFeb 24, 2026 18:51Mikołaj UzarskiMikołaj UzarskiScore: 5,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 18:515,42872,269,43741,050,0004,004,0002,396,160
2Feb 24, 2026 18:525,45270,942,57741,233,0004,022,0002,449,408
3Feb 24, 2026 18:515,56666,506,36839,170,0007,030,0002,519,040
4Feb 24, 2026 18:525,65676,634,78539,953,0006,991,0002,441,216
5Feb 24, 2026 18:516,21277,057,12946,508,0005,055,0002,420,736
6Feb 24, 2026 18:526,46778,101,77749,628,0004,051,0002,445,312