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 listJan 3, 2026 06:47KeefeKeefeScore: 50,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 06:4750,013437,874,322415,105,00002,269,184
2Jan 3, 2026 06:4750,030442,358,682412,252,0003,001,0002,269,184
3Jan 3, 2026 06:4750,032437,791,467413,266,0002,001,0002,269,184