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 listJul 14, 2026 21:02Kevin HeaveyKevin HeaveyScore: 3,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 21:043,69940,347,96829,678,0001,027,0002,117,632
2Jul 14, 2026 21:043,69940,405,44129,679,0001,028,0002,117,632
3Jul 14, 2026 21:043,70040,321,55529,686,0001,024,0002,117,632
4Jul 14, 2026 21:043,70440,311,91229,722,0001,023,0002,117,632
5Jul 14, 2026 21:043,71140,582,11429,786,0001,023,0002,117,632
6Jul 14, 2026 21:045,51655,509,82544,771,0001,018,0002,117,632
7Jul 14, 2026 21:045,53155,531,25244,895,0001,019,0002,117,632
8Jul 14, 2026 21:045,55555,749,02645,094,0001,019,0002,117,632
9Jul 14, 2026 21:045,60256,117,50145,480,0001,019,0002,117,632