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 18, 2026 23:45Mikołaj UzarskiMikołaj UzarskiScore: 5,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 23:475,70773,565,90340,316,0007,055,0002,514,944
2Feb 18, 2026 23:455,73278,427,06441,504,0006,073,0002,441,216
3Feb 18, 2026 23:455,75478,452,10142,787,0004,975,0002,367,488
4Feb 18, 2026 23:475,80570,574,84742,159,0006,022,0002,330,624
5Feb 18, 2026 23:475,85678,224,04242,532,0006,076,0002,408,448
6Feb 18, 2026 23:455,86485,730,02542,586,0006,083,0002,457,600