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 20, 2025 18:41ttmxttmxScore: 33,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2025 18:4132,568292,148,214268,315,0002,002,0002,281,472
2Jan 20, 2025 18:4133,826306,669,217279,754,000999,0002,273,280
3Jan 20, 2025 18:4133,827305,013,056277,768,0002,997,0002,269,184