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 listJun 30, 2026 19:50KnyukuaKnyukuaScore: 67,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 19:5067,789572,703,248498,420,00064,233,0002,113,536
2Jun 30, 2026 19:5067,832572,896,216498,859,00064,147,0002,113,536
3Jun 30, 2026 19:5067,860573,239,868499,068,00064,177,0002,113,536
4Jun 30, 2026 19:5067,871573,332,174499,164,00064,169,0002,113,536
5Jun 30, 2026 19:5067,883572,982,695499,243,00064,187,0002,113,536
6Jun 30, 2026 19:5067,896573,445,868499,328,00064,213,0002,113,536
7Jun 30, 2026 19:5068,012574,001,942499,297,00065,208,0002,113,536
8Jun 30, 2026 19:5068,012574,028,890499,316,00065,184,0002,113,536
9Jun 30, 2026 19:5068,044574,374,484499,538,00065,233,0002,113,536