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 22, 2026 06:11Kevin HeaveyKevin HeaveyScore: 4,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 06:174,16044,353,87630,099,0004,435,0002,121,728
2Jul 22, 2026 06:174,19244,655,72930,451,0004,350,0002,117,632
3Jul 22, 2026 06:174,19244,697,24930,181,0004,617,0002,117,632
4Jul 22, 2026 06:174,21044,812,34330,365,0004,578,0002,117,632
5Jul 22, 2026 06:174,36946,258,39231,640,0004,629,0002,117,632
6Jul 22, 2026 06:174,40646,516,50231,971,0004,600,0002,121,728
7Jul 22, 2026 06:174,42747,203,84332,131,0004,619,0002,117,632
8Jul 22, 2026 06:174,45948,503,19732,695,0004,316,0002,117,632
9Jul 22, 2026 06:174,52549,275,65133,058,0004,500,0002,117,632