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 29, 2026 08:32Adam FolwarcznyAdam FolwarcznyScore: 15,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 08:3214,867132,747,828122,250,0001,154,0002,113,536
2Jun 29, 2026 08:3215,087134,562,040124,066,0001,160,0002,113,536
3Jun 29, 2026 08:3215,217135,604,575125,138,0001,167,0002,113,536
4Jun 29, 2026 08:3215,266136,028,813125,552,0001,161,0002,113,536
5Jun 29, 2026 08:3215,348136,707,068126,241,0001,150,0002,113,536
6Jun 29, 2026 08:3215,375137,005,509126,458,0001,155,0002,113,536
7Jun 29, 2026 08:3215,391137,102,503126,638,0001,113,0002,113,536
8Jun 29, 2026 08:3215,433137,416,593126,946,0001,155,0002,113,536
9Jun 29, 2026 08:3215,527138,240,056127,726,0001,151,0002,113,536