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 listMay 25, 2026 16:22Kenzie_RTKenzie_RTScore: 63,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:2263,605539,035,290526,791,0001,135,0002,113,536
2May 25, 2026 16:2263,697537,867,336527,524,0001,166,0002,113,536
3May 25, 2026 16:2263,788540,802,072528,334,0001,113,0002,113,536
4May 25, 2026 16:2263,853539,213,762528,931,0001,052,0002,113,536
5May 25, 2026 16:2263,916539,885,900529,374,0001,133,0002,113,536
6May 25, 2026 16:2263,919541,681,602529,496,0001,038,0002,113,536
7May 25, 2026 16:2264,106543,756,313530,958,0001,126,0002,113,536
8May 25, 2026 16:2264,682546,345,763535,778,0001,086,0002,113,536
9May 25, 2026 16:2264,901549,626,047537,677,0001,007,0002,113,536