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 listMar 19, 2025 10:37Brandon TangBrandon TangScore: 97,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2025 10:3797,223829,625,055805,956,000999,0002,265,088
2Mar 19, 2025 10:3797,281835,199,248805,437,0001,998,0002,281,472
3Mar 19, 2025 10:3797,281836,512,886805,437,0001,998,0002,289,664
4Mar 19, 2025 10:3797,286832,811,912804,472,0002,998,0002,379,776
5Mar 19, 2025 10:3797,328829,401,228805,823,0001,999,0002,265,088
6Mar 19, 2025 10:3797,332831,915,604805,859,0001,999,0002,289,664
7Mar 19, 2025 10:3797,348831,368,225806,987,000999,0002,265,088
8Mar 19, 2025 10:3797,353830,578,715807,027,0001,000,0002,269,184
9Mar 19, 2025 10:3797,425831,594,219807,628,000999,0002,523,136