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 27, 2026 01:54Kevin HeaveyKevin HeaveyScore: 5,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 01:565,05252,023,52628,464,00013,472,0002,113,536
2Jul 27, 2026 01:565,12152,631,43829,149,00013,363,00020,480
3Jul 27, 2026 01:565,21853,315,07228,639,00014,671,0002,113,536
4Jul 27, 2026 01:565,23853,532,48628,942,00014,537,0002,113,536
5Jul 27, 2026 01:565,30454,085,68428,656,00015,368,0002,113,536
6Jul 27, 2026 01:565,36454,753,85430,538,00013,991,0002,113,536
7Jul 27, 2026 01:565,39354,793,59530,867,00013,899,00020,480
8Jul 27, 2026 01:565,42256,938,27829,945,00015,061,0002,113,536
9Jul 27, 2026 01:565,56456,562,65730,206,00015,976,0002,113,536