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 listApr 22, 2026 16:09Charles CabergsCharles CabergsScore: 19,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 16:1019,989181,331,000162,918,0002,998,0002,338,816
2Apr 22, 2026 16:1019,991180,058,916162,930,0002,998,0002,519,040
3Apr 22, 2026 16:1019,993183,458,901162,946,0002,999,0002,519,040
4Apr 22, 2026 16:1019,993188,823,648162,951,0002,999,0002,523,136
5Apr 22, 2026 16:1019,993184,524,701162,944,0002,998,0002,322,432
6Apr 22, 2026 16:1020,009180,968,049163,074,0003,001,0002,523,136
7Apr 22, 2026 16:1020,012181,464,288163,104,0003,001,0002,510,848
8Apr 22, 2026 16:1020,014184,810,641163,119,0003,002,0002,334,720
9Apr 22, 2026 16:1020,770188,484,885170,395,0002,004,0002,514,944