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 listFeb 22, 2026 14:01SneedSneedScore: 74,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 14:0173,819653,849,284492,154,000120,547,0003,145,728
2Feb 22, 2026 14:0174,043650,327,598481,871,000132,689,0003,063,808
3Feb 22, 2026 14:0174,288646,834,148505,030,000111,564,0003,043,328