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 6, 2026 15:40merripiummerripiumScore: 73,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 15:4173,758621,262,177553,044,00059,149,0002,113,536
2Jun 6, 2026 15:4173,785621,572,215553,229,00059,189,0002,113,536
3Jun 6, 2026 15:4173,816621,673,344552,500,00060,174,0002,113,536
4Jun 6, 2026 15:4173,919622,743,900552,214,00061,319,0002,113,536
5Jun 6, 2026 15:4173,930622,704,612553,420,00060,202,0002,113,536
6Jun 6, 2026 15:4173,930622,716,631553,522,00060,103,0002,113,536
7Jun 6, 2026 15:4173,981623,125,938552,884,00061,159,0002,113,536
8Jun 6, 2026 15:4174,016623,477,363553,176,00061,160,0002,113,536
9Jun 6, 2026 15:4174,184624,831,646552,580,00063,155,0002,113,536