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 23:41Charles CabergsCharles CabergsScore: 20,741Success
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 23:4120,005188,944,772163,044,0003,000,0002,519,040
2Apr 22, 2026 23:4120,006181,067,399163,056,0003,001,0002,338,816
3Apr 22, 2026 23:4120,014183,603,105163,121,0003,002,0002,535,424
4Apr 22, 2026 23:4120,016186,658,313163,132,0003,002,0002,519,040
5Apr 22, 2026 23:4120,741188,391,480170,154,0002,001,0002,519,040
6Apr 22, 2026 23:4120,754187,496,877170,262,0002,003,0002,514,944
7Apr 22, 2026 23:4120,769191,828,508171,384,0001,002,0002,514,944
8Apr 22, 2026 23:4120,774195,619,314170,427,0002,005,0002,527,232
9Apr 22, 2026 23:4120,780191,608,774170,470,0002,005,0002,519,040